{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7NP7Q7L6X4FF424TPCOCPXKF2I","short_pith_number":"pith:7NP7Q7L6","schema_version":"1.0","canonical_sha256":"fb5ff87d7ebf0a5e6b93789c27dd45d20e5b8fb87371d54cdbe04ae6512bb627","source":{"kind":"arxiv","id":"1712.02575","version":2},"attestation_state":"computed","paper":{"title":"Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Han-Mu Park, Kuk-Jin Yoon","submitted_at":"2017-12-07T11:59:54Z","abstract_excerpt":"We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified framework. The main contribution of this paper is twofold. First, we formulate the global correspondence search problem of multi-attributed graphs by utilizing a set of multi-layer structures. The proposed formulation describes each pair of graphs as a multi-layer structure, and jointly considers whole matching pairs. Second, we propose a robust multiple graph"},"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":"1712.02575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-07T11:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"5b786c94ac164c4a4b229e5a6588c6ee7491684c9cf887f257338b61f4cfa879","abstract_canon_sha256":"9772187a0fc111ceb3e2e7004f3fededa1d203794ea482a3bbb9967ac930bdd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.871516Z","signature_b64":"9b/gAeqpSZHYOUflWwHJRvfZfnWEA6q0XTxoykyBW8hUWumwj/qr4LkXLJonDURE9RGy7tDXQcdbR2NkDsCzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb5ff87d7ebf0a5e6b93789c27dd45d20e5b8fb87371d54cdbe04ae6512bb627","last_reissued_at":"2026-05-18T00:20:55.871062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.871062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Han-Mu Park, Kuk-Jin Yoon","submitted_at":"2017-12-07T11:59:54Z","abstract_excerpt":"We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified framework. The main contribution of this paper is twofold. First, we formulate the global correspondence search problem of multi-attributed graphs by utilizing a set of multi-layer structures. The proposed formulation describes each pair of graphs as a multi-layer structure, and jointly considers whole matching pairs. Second, we propose a robust multiple graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02575","kind":"arxiv","version":2},"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":"1712.02575","created_at":"2026-05-18T00:20:55.871130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02575v2","created_at":"2026-05-18T00:20:55.871130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02575","created_at":"2026-05-18T00:20:55.871130+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NP7Q7L6X4FF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NP7Q7L6X4FF424T","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NP7Q7L6","created_at":"2026-05-18T12:31:05.417338+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/7NP7Q7L6X4FF424TPCOCPXKF2I","json":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I.json","graph_json":"https://pith.science/api/pith-number/7NP7Q7L6X4FF424TPCOCPXKF2I/graph.json","events_json":"https://pith.science/api/pith-number/7NP7Q7L6X4FF424TPCOCPXKF2I/events.json","paper":"https://pith.science/paper/7NP7Q7L6"},"agent_actions":{"view_html":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I","download_json":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I.json","view_paper":"https://pith.science/paper/7NP7Q7L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02575&json=true","fetch_graph":"https://pith.science/api/pith-number/7NP7Q7L6X4FF424TPCOCPXKF2I/graph.json","fetch_events":"https://pith.science/api/pith-number/7NP7Q7L6X4FF424TPCOCPXKF2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I/action/storage_attestation","attest_author":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I/action/author_attestation","sign_citation":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I/action/citation_signature","submit_replication":"https://pith.science/pith/7NP7Q7L6X4FF424TPCOCPXKF2I/action/replication_record"}},"created_at":"2026-05-18T00:20:55.871130+00:00","updated_at":"2026-05-18T00:20:55.871130+00:00"}