{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GJO4RQIGFXWWW7KKVYFUGZIPZ6","short_pith_number":"pith:GJO4RQIG","schema_version":"1.0","canonical_sha256":"325dc8c1062ded6b7d4aae0b43650fcfbdef96fe77d65700b11fb4721a951852","source":{"kind":"arxiv","id":"1410.3301","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Optimization of Both Node and Edge Conservation in Network Alignment via WAVE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.MN","authors_text":"Jie Tang, Joseph Crawford, Tijana Milenkovi\\'c, Yihan Sun","submitted_at":"2014-10-13T13:38:30Z","abstract_excerpt":"Network alignment can be used to transfer functional knowledge between conserved regions of different networks. Typically, existing methods use a node cost function (NCF) to compute similarity between nodes in different networks and an alignment strategy (AS) to find high-scoring alignments with respect to the total NCF over all aligned nodes (or node conservation). But, they then evaluate quality of their alignments via some other measure that is different than the node conservation measure used to guide the alignment construction process. Typically, one measures the amount of conserved edges"},"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.3301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2014-10-13T13:38:30Z","cross_cats_sorted":[],"title_canon_sha256":"11f89d1686101040969499bfb1f95f6cfad5d53417f31251f8eb7ec261af675b","abstract_canon_sha256":"21a94b2bf3779949b407e53fd9271cd1bf77a73052cb08cb8110b53e3366c208"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:11.611691Z","signature_b64":"OgCh4PA+PkSa0TN0ehjBj9oJ7OZDkox5Nv8KHnbRLI1+4z4XbKahEPkOdCVCitxImFo1fut6BTPEmv1xUjeIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"325dc8c1062ded6b7d4aae0b43650fcfbdef96fe77d65700b11fb4721a951852","last_reissued_at":"2026-05-18T02:40:11.611225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:11.611225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Optimization of Both Node and Edge Conservation in Network Alignment via WAVE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.MN","authors_text":"Jie Tang, Joseph Crawford, Tijana Milenkovi\\'c, Yihan Sun","submitted_at":"2014-10-13T13:38:30Z","abstract_excerpt":"Network alignment can be used to transfer functional knowledge between conserved regions of different networks. Typically, existing methods use a node cost function (NCF) to compute similarity between nodes in different networks and an alignment strategy (AS) to find high-scoring alignments with respect to the total NCF over all aligned nodes (or node conservation). But, they then evaluate quality of their alignments via some other measure that is different than the node conservation measure used to guide the alignment construction process. Typically, one measures the amount of conserved edges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3301","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.3301","created_at":"2026-05-18T02:40:11.611290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3301v1","created_at":"2026-05-18T02:40:11.611290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3301","created_at":"2026-05-18T02:40:11.611290+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJO4RQIGFXWW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJO4RQIGFXWWW7KK","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJO4RQIG","created_at":"2026-05-18T12:28:30.664211+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/GJO4RQIGFXWWW7KKVYFUGZIPZ6","json":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6.json","graph_json":"https://pith.science/api/pith-number/GJO4RQIGFXWWW7KKVYFUGZIPZ6/graph.json","events_json":"https://pith.science/api/pith-number/GJO4RQIGFXWWW7KKVYFUGZIPZ6/events.json","paper":"https://pith.science/paper/GJO4RQIG"},"agent_actions":{"view_html":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6","download_json":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6.json","view_paper":"https://pith.science/paper/GJO4RQIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3301&json=true","fetch_graph":"https://pith.science/api/pith-number/GJO4RQIGFXWWW7KKVYFUGZIPZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/GJO4RQIGFXWWW7KKVYFUGZIPZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6/action/storage_attestation","attest_author":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6/action/author_attestation","sign_citation":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6/action/citation_signature","submit_replication":"https://pith.science/pith/GJO4RQIGFXWWW7KKVYFUGZIPZ6/action/replication_record"}},"created_at":"2026-05-18T02:40:11.611290+00:00","updated_at":"2026-05-18T02:40:11.611290+00:00"}