{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RUID2S2CCYQAQUTEFWA5O6H5W2","short_pith_number":"pith:RUID2S2C","schema_version":"1.0","canonical_sha256":"8d103d4b4216200852642d81d778fdb6803886aa6059bae6c3faa45b823aeb60","source":{"kind":"arxiv","id":"1704.07077","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Multi-layer Graph Factorization for Multi-attributed Graph Matching","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-04-24T08:08:32Z","abstract_excerpt":"Multi-attributed graph matching is a problem of finding correspondences between two sets of data while considering their complex properties described in multiple attributes. However, the information of multiple attributes is likely to be oversimplified during a process that makes an integrated attribute, and this degrades the matching accuracy. For that reason, a multi-layer graph structure-based algorithm has been proposed recently. It can effectively avoid the problem by separating attributes into multiple layers. Nonetheless, there are several remaining issues such as a scalability problem "},"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":"1704.07077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-24T08:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"0578d66e7fda15596bbfc85ffc95ebea81404e3330e294d2ef7d50c8774cb328","abstract_canon_sha256":"8502599968de69f662259c63c2988ec093460648f5bbfbb306e0668bce660b53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.648143Z","signature_b64":"bdpVJI16Pxu26Fc3gEYoUMRTgIThVbbywgQp49ia/zQBOgUoFIQa6tNGIpikLHNFOXU/WsvNumsvP0bHHGxqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d103d4b4216200852642d81d778fdb6803886aa6059bae6c3faa45b823aeb60","last_reissued_at":"2026-05-18T00:45:53.647633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.647633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Multi-layer Graph Factorization for Multi-attributed Graph Matching","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-04-24T08:08:32Z","abstract_excerpt":"Multi-attributed graph matching is a problem of finding correspondences between two sets of data while considering their complex properties described in multiple attributes. However, the information of multiple attributes is likely to be oversimplified during a process that makes an integrated attribute, and this degrades the matching accuracy. For that reason, a multi-layer graph structure-based algorithm has been proposed recently. It can effectively avoid the problem by separating attributes into multiple layers. Nonetheless, there are several remaining issues such as a scalability problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07077","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":"1704.07077","created_at":"2026-05-18T00:45:53.647712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07077v1","created_at":"2026-05-18T00:45:53.647712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07077","created_at":"2026-05-18T00:45:53.647712+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUID2S2CCYQA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUID2S2CCYQAQUTE","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUID2S2C","created_at":"2026-05-18T12:31:39.905425+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/RUID2S2CCYQAQUTEFWA5O6H5W2","json":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2.json","graph_json":"https://pith.science/api/pith-number/RUID2S2CCYQAQUTEFWA5O6H5W2/graph.json","events_json":"https://pith.science/api/pith-number/RUID2S2CCYQAQUTEFWA5O6H5W2/events.json","paper":"https://pith.science/paper/RUID2S2C"},"agent_actions":{"view_html":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2","download_json":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2.json","view_paper":"https://pith.science/paper/RUID2S2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07077&json=true","fetch_graph":"https://pith.science/api/pith-number/RUID2S2CCYQAQUTEFWA5O6H5W2/graph.json","fetch_events":"https://pith.science/api/pith-number/RUID2S2CCYQAQUTEFWA5O6H5W2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/action/storage_attestation","attest_author":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/action/author_attestation","sign_citation":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/action/citation_signature","submit_replication":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/action/replication_record"}},"created_at":"2026-05-18T00:45:53.647712+00:00","updated_at":"2026-05-18T00:45:53.647712+00:00"}