{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RUID2S2CCYQAQUTEFWA5O6H5W2","short_pith_number":"pith:RUID2S2C","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"},"canonical_sha256":"8d103d4b4216200852642d81d778fdb6803886aa6059bae6c3faa45b823aeb60","source":{"kind":"arxiv","id":"1704.07077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07077","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07077v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07077","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"RUID2S2CCYQA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUID2S2CCYQAQUTE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUID2S2C","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RUID2S2CCYQAQUTEFWA5O6H5W2","target":"record","payload":{"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"},"canonical_sha256":"8d103d4b4216200852642d81d778fdb6803886aa6059bae6c3faa45b823aeb60","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"},"source_kind":"arxiv","source_id":"1704.07077","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKttEtmMaTmFsICSpWt2s89VtCjI+hE8FmYl7nORivyVCnVk/rMV/kU/gsPAbbVo7vc8v0X6WF/1utEaR6WUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:56:30.949564Z"},"content_sha256":"15ce8fa001a8f3566d1bd114c3bd9334b33131c4cb26964e9816abb98b82900e","schema_version":"1.0","event_id":"sha256:15ce8fa001a8f3566d1bd114c3bd9334b33131c4cb26964e9816abb98b82900e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RUID2S2CCYQAQUTEFWA5O6H5W2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyjxJNC3zhfSQmCcDP1DDvuxnQOf3A020xudIjskFu3Hvh+wylgErkG+fKqDHQZT6vCJ7X5g9HB/+8/fo28GCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:56:30.950223Z"},"content_sha256":"3e86e994f31dad69bb5ba19919ecfbb1ca7a6ec71578e5b6a6a26ac45d6207b1","schema_version":"1.0","event_id":"sha256:3e86e994f31dad69bb5ba19919ecfbb1ca7a6ec71578e5b6a6a26ac45d6207b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/bundle.json","state_url":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T11:56:30Z","links":{"resolver":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2","bundle":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/bundle.json","state":"https://pith.science/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUID2S2CCYQAQUTEFWA5O6H5W2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RUID2S2CCYQAQUTEFWA5O6H5W2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8502599968de69f662259c63c2988ec093460648f5bbfbb306e0668bce660b53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-24T08:08:32Z","title_canon_sha256":"0578d66e7fda15596bbfc85ffc95ebea81404e3330e294d2ef7d50c8774cb328"},"schema_version":"1.0","source":{"id":"1704.07077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07077","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07077v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07077","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"RUID2S2CCYQA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUID2S2CCYQAQUTE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUID2S2C","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:3e86e994f31dad69bb5ba19919ecfbb1ca7a6ec71578e5b6a6a26ac45d6207b1","target":"graph","created_at":"2026-05-18T00:45:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Han-Mu Park, Kuk-Jin Yoon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-24T08:08:32Z","title":"Exploiting Multi-layer Graph Factorization for Multi-attributed Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07077","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:15ce8fa001a8f3566d1bd114c3bd9334b33131c4cb26964e9816abb98b82900e","target":"record","created_at":"2026-05-18T00:45:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8502599968de69f662259c63c2988ec093460648f5bbfbb306e0668bce660b53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-24T08:08:32Z","title_canon_sha256":"0578d66e7fda15596bbfc85ffc95ebea81404e3330e294d2ef7d50c8774cb328"},"schema_version":"1.0","source":{"id":"1704.07077","kind":"arxiv","version":1}},"canonical_sha256":"8d103d4b4216200852642d81d778fdb6803886aa6059bae6c3faa45b823aeb60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d103d4b4216200852642d81d778fdb6803886aa6059bae6c3faa45b823aeb60","first_computed_at":"2026-05-18T00:45:53.647633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:53.647633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bdpVJI16Pxu26Fc3gEYoUMRTgIThVbbywgQp49ia/zQBOgUoFIQa6tNGIpikLHNFOXU/WsvNumsvP0bHHGxqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:53.648143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15ce8fa001a8f3566d1bd114c3bd9334b33131c4cb26964e9816abb98b82900e","sha256:3e86e994f31dad69bb5ba19919ecfbb1ca7a6ec71578e5b6a6a26ac45d6207b1"],"state_sha256":"ceb486996b7c58787cf4a88bb0a2160363a054f54159109b04b81c25971f0741"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKnAvt0niEOyFhQ+By84iLXi9JX9X+w3gwvPTRVWu5ydYlpGtfK7thnJaEYfxyYeRpLbcnoQkpucDX9He9H0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:56:30.953383Z","bundle_sha256":"27d8d82622104b78281e446ecafb40cee4a3a8ad59de3321d6104d0128ae319b"}}