{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NLPOYY6ITILKP4RGFXBKHP7UU3","short_pith_number":"pith:NLPOYY6I","schema_version":"1.0","canonical_sha256":"6adeec63c89a16a7f2262dc2a3bff4a6d028ad44b899081dee63ee0ee55ac7da","source":{"kind":"arxiv","id":"1410.5103","version":1},"attestation_state":"computed","paper":{"title":"GREAT: GRaphlet Edge-based network AlignmenT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.MN","authors_text":"Joseph Crawford, Tijana Milenkovi\\'c","submitted_at":"2014-10-19T19:03:50Z","abstract_excerpt":"Network alignment aims to find regions of topological or functional similarities between networks. In computational biology, it can be used to transfer biological knowledge from a well-studied species to a poorly-studied species between aligned network regions. Typically, existing network aligners first compute similarities between nodes in different networks (via a node cost function) and then aim to find a high-scoring alignment (node mapping between the networks) with respect to \"node conservation\", typically the total node cost function over all aligned nodes. Only after an alignment is co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.5103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2014-10-19T19:03:50Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"8b8460359c24df48c6c27fffecf4a510967825146f7683dfd767e4d5e53897eb","abstract_canon_sha256":"6b80ddf9b4f9af81d85c84d4959660db1ab301f19fd974aeb7eb6ec94800b5bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.914371Z","signature_b64":"TuzueU+myvWeu4yMe3OD8wTL9TXIPBdL2Rn/gSvaaj+cjHEa9k02WyhQoE6Qr42FFI4vxSVEtg6GJr8LTuJ3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6adeec63c89a16a7f2262dc2a3bff4a6d028ad44b899081dee63ee0ee55ac7da","last_reissued_at":"2026-05-18T02:39:46.913983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.913983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GREAT: GRaphlet Edge-based network AlignmenT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.MN","authors_text":"Joseph Crawford, Tijana Milenkovi\\'c","submitted_at":"2014-10-19T19:03:50Z","abstract_excerpt":"Network alignment aims to find regions of topological or functional similarities between networks. In computational biology, it can be used to transfer biological knowledge from a well-studied species to a poorly-studied species between aligned network regions. Typically, existing network aligners first compute similarities between nodes in different networks (via a node cost function) and then aim to find a high-scoring alignment (node mapping between the networks) with respect to \"node conservation\", typically the total node cost function over all aligned nodes. Only after an alignment is co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5103","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5103","created_at":"2026-05-18T02:39:46.914039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5103v1","created_at":"2026-05-18T02:39:46.914039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5103","created_at":"2026-05-18T02:39:46.914039+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLPOYY6ITILK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLPOYY6ITILKP4RG","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLPOYY6I","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3","json":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3.json","graph_json":"https://pith.science/api/pith-number/NLPOYY6ITILKP4RGFXBKHP7UU3/graph.json","events_json":"https://pith.science/api/pith-number/NLPOYY6ITILKP4RGFXBKHP7UU3/events.json","paper":"https://pith.science/paper/NLPOYY6I"},"agent_actions":{"view_html":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3","download_json":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3.json","view_paper":"https://pith.science/paper/NLPOYY6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5103&json=true","fetch_graph":"https://pith.science/api/pith-number/NLPOYY6ITILKP4RGFXBKHP7UU3/graph.json","fetch_events":"https://pith.science/api/pith-number/NLPOYY6ITILKP4RGFXBKHP7UU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3/action/storage_attestation","attest_author":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3/action/author_attestation","sign_citation":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3/action/citation_signature","submit_replication":"https://pith.science/pith/NLPOYY6ITILKP4RGFXBKHP7UU3/action/replication_record"}},"created_at":"2026-05-18T02:39:46.914039+00:00","updated_at":"2026-05-18T02:39:46.914039+00:00"}