{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TJ6QRCXE4ACLMATMRN47EKAFCU","short_pith_number":"pith:TJ6QRCXE","schema_version":"1.0","canonical_sha256":"9a7d088ae4e004b6026c8b79f22805151c139339e532c032d5dce2b8cb0672ea","source":{"kind":"arxiv","id":"1803.03882","version":1},"attestation_state":"computed","paper":{"title":"An Iterative Global Structure-Assisted Labeled Network Aligner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Abdurrahman Ya\\c{s}ar, \\\"Umit V. \\c{C}ataly\\\"urek","submitted_at":"2018-03-11T02:03:31Z","abstract_excerpt":"Integrating data from heterogeneous sources is often modeled as merging graphs. Given two or more 'compatible', but not-isomorphic graphs, the first step is to identify a graph alignment, where a potentially partial mapping of vertices between two graphs is computed. A significant portion of the literature on this problem only takes the global structure of the input graphs into account. Only more recent ones additionally use vertex and edge attributes to achieve a more accurate alignment. However, these methods are not designed to scale to map large graphs arising in many modern applications. "},"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":"1803.03882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-03-11T02:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"1573e70e2d6979b03c183cc0d9eee4b717f647a0129dbc5e9c75ff4b4e3ab366","abstract_canon_sha256":"c8451cf583095e9773bb46737246d951f31517a0ef291ca27a058eb302a39a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:33.545054Z","signature_b64":"sTJ2lwK9xJvnqguicvV11ejebXMjrydZMQQyzHM+rnYBwmXVvMLMoQ3J6fCabk9tjdflqBdGtE90Aszj5ShmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a7d088ae4e004b6026c8b79f22805151c139339e532c032d5dce2b8cb0672ea","last_reissued_at":"2026-05-18T00:21:33.544432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:33.544432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterative Global Structure-Assisted Labeled Network Aligner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Abdurrahman Ya\\c{s}ar, \\\"Umit V. \\c{C}ataly\\\"urek","submitted_at":"2018-03-11T02:03:31Z","abstract_excerpt":"Integrating data from heterogeneous sources is often modeled as merging graphs. Given two or more 'compatible', but not-isomorphic graphs, the first step is to identify a graph alignment, where a potentially partial mapping of vertices between two graphs is computed. A significant portion of the literature on this problem only takes the global structure of the input graphs into account. Only more recent ones additionally use vertex and edge attributes to achieve a more accurate alignment. However, these methods are not designed to scale to map large graphs arising in many modern applications. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03882","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":"1803.03882","created_at":"2026-05-18T00:21:33.544514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03882v1","created_at":"2026-05-18T00:21:33.544514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03882","created_at":"2026-05-18T00:21:33.544514+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJ6QRCXE4ACL","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJ6QRCXE4ACLMATM","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJ6QRCXE","created_at":"2026-05-18T12:32:53.628368+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/TJ6QRCXE4ACLMATMRN47EKAFCU","json":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU.json","graph_json":"https://pith.science/api/pith-number/TJ6QRCXE4ACLMATMRN47EKAFCU/graph.json","events_json":"https://pith.science/api/pith-number/TJ6QRCXE4ACLMATMRN47EKAFCU/events.json","paper":"https://pith.science/paper/TJ6QRCXE"},"agent_actions":{"view_html":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU","download_json":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU.json","view_paper":"https://pith.science/paper/TJ6QRCXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03882&json=true","fetch_graph":"https://pith.science/api/pith-number/TJ6QRCXE4ACLMATMRN47EKAFCU/graph.json","fetch_events":"https://pith.science/api/pith-number/TJ6QRCXE4ACLMATMRN47EKAFCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU/action/storage_attestation","attest_author":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU/action/author_attestation","sign_citation":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU/action/citation_signature","submit_replication":"https://pith.science/pith/TJ6QRCXE4ACLMATMRN47EKAFCU/action/replication_record"}},"created_at":"2026-05-18T00:21:33.544514+00:00","updated_at":"2026-05-18T00:21:33.544514+00:00"}