{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KXXACXQAPLVH65WQYYKUWRHLUZ","short_pith_number":"pith:KXXACXQA","canonical_record":{"source":{"id":"2301.01932","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-05T06:54:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a85667e6b7ec61ba6dce29d99b5c0cc4a394b994e9030dcff13a7897811c9b6f","abstract_canon_sha256":"9517b87b9085c0e337f3dbf4f93df48102999983148b510ec315cde1490a40d6"},"schema_version":"1.0"},"canonical_sha256":"55ee015e007aea7f76d0c6154b44eba658ed145b3e68c7f130d56b1de89388d6","source":{"kind":"arxiv","id":"2301.01932","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01932","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01932v1","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01932","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"KXXACXQAPLVH","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"KXXACXQAPLVH65WQ","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"KXXACXQA","created_at":"2026-07-05T05:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KXXACXQAPLVH65WQYYKUWRHLUZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.01932","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-05T06:54:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a85667e6b7ec61ba6dce29d99b5c0cc4a394b994e9030dcff13a7897811c9b6f","abstract_canon_sha256":"9517b87b9085c0e337f3dbf4f93df48102999983148b510ec315cde1490a40d6"},"schema_version":"1.0"},"canonical_sha256":"55ee015e007aea7f76d0c6154b44eba658ed145b3e68c7f130d56b1de89388d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:48.161395Z","signature_b64":"0TbOJqLt+NJkxnnShtc79jQXwuXK70LEkZ/7aWI2K+nCbe9BDO8J7EZTTSMBoBSNswBlTJAkji4xo7eHWADqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55ee015e007aea7f76d0c6154b44eba658ed145b3e68c7f130d56b1de89388d6","last_reissued_at":"2026-07-05T05:30:48.160980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:48.160980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.01932","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-07-05T05:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGYozy1PpLLBTekFyWYxhj6cbMhpvfr7wlVXeLNWpIt5btVDk1aqgIHWVS3vzRgScdfB1ZyaAXB20VEpgHWLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:10:17.527537Z"},"content_sha256":"679234a651e61154ed806008c9fcb050ff85d4802e747633c9da2e10ae1fac34","schema_version":"1.0","event_id":"sha256:679234a651e61154ed806008c9fcb050ff85d4802e747633c9da2e10ae1fac34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KXXACXQAPLVH65WQYYKUWRHLUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Dongdong Chen, Lichi Zhang, Yuxing Dai, Zhihong Zhang","submitted_at":"2023-01-05T06:54:21Z","abstract_excerpt":"Graph matching can be formalized as a combinatorial optimization problem, where there are corresponding relationships between pairs of nodes that can be represented as edges. This problem becomes challenging when there are potential ambiguities present due to nodes and edges with high similarity, and there is a need to find accurate results for similar content matching. In this paper, we introduce a novel end-to-end neural network that can map the linear assignment problem into a high-dimensional space augmented with node-level relative position information, which is crucial for improving the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01932","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.01932/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fj4ohO23c6S9E0VsvihDvF/IL5P+Fy03t8CDK6NSboFXGLqqHqBLWqK/DGsqA/VMnWY/ozz0JjyC6P4PmM3eBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:10:17.528067Z"},"content_sha256":"eb311f17603c213eff4b60c63d00058d1e1608d3171a033e7716c16989728df2","schema_version":"1.0","event_id":"sha256:eb311f17603c213eff4b60c63d00058d1e1608d3171a033e7716c16989728df2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXXACXQAPLVH65WQYYKUWRHLUZ/bundle.json","state_url":"https://pith.science/pith/KXXACXQAPLVH65WQYYKUWRHLUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXXACXQAPLVH65WQYYKUWRHLUZ/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-08-04T08:10:17Z","links":{"resolver":"https://pith.science/pith/KXXACXQAPLVH65WQYYKUWRHLUZ","bundle":"https://pith.science/pith/KXXACXQAPLVH65WQYYKUWRHLUZ/bundle.json","state":"https://pith.science/pith/KXXACXQAPLVH65WQYYKUWRHLUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXXACXQAPLVH65WQYYKUWRHLUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KXXACXQAPLVH65WQYYKUWRHLUZ","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":"9517b87b9085c0e337f3dbf4f93df48102999983148b510ec315cde1490a40d6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-05T06:54:21Z","title_canon_sha256":"a85667e6b7ec61ba6dce29d99b5c0cc4a394b994e9030dcff13a7897811c9b6f"},"schema_version":"1.0","source":{"id":"2301.01932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01932","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01932v1","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01932","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"KXXACXQAPLVH","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"KXXACXQAPLVH65WQ","created_at":"2026-07-05T05:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"KXXACXQA","created_at":"2026-07-05T05:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:eb311f17603c213eff4b60c63d00058d1e1608d3171a033e7716c16989728df2","target":"graph","created_at":"2026-07-05T05:30:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.01932/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph matching can be formalized as a combinatorial optimization problem, where there are corresponding relationships between pairs of nodes that can be represented as edges. This problem becomes challenging when there are potential ambiguities present due to nodes and edges with high similarity, and there is a need to find accurate results for similar content matching. In this paper, we introduce a novel end-to-end neural network that can map the linear assignment problem into a high-dimensional space augmented with node-level relative position information, which is crucial for improving the ","authors_text":"Dongdong Chen, Lichi Zhang, Yuxing Dai, Zhihong Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-05T06:54:21Z","title":"PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01932","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:679234a651e61154ed806008c9fcb050ff85d4802e747633c9da2e10ae1fac34","target":"record","created_at":"2026-07-05T05:30:48Z","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":"9517b87b9085c0e337f3dbf4f93df48102999983148b510ec315cde1490a40d6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-05T06:54:21Z","title_canon_sha256":"a85667e6b7ec61ba6dce29d99b5c0cc4a394b994e9030dcff13a7897811c9b6f"},"schema_version":"1.0","source":{"id":"2301.01932","kind":"arxiv","version":1}},"canonical_sha256":"55ee015e007aea7f76d0c6154b44eba658ed145b3e68c7f130d56b1de89388d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55ee015e007aea7f76d0c6154b44eba658ed145b3e68c7f130d56b1de89388d6","first_computed_at":"2026-07-05T05:30:48.160980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:30:48.160980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0TbOJqLt+NJkxnnShtc79jQXwuXK70LEkZ/7aWI2K+nCbe9BDO8J7EZTTSMBoBSNswBlTJAkji4xo7eHWADqAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:30:48.161395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.01932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:679234a651e61154ed806008c9fcb050ff85d4802e747633c9da2e10ae1fac34","sha256:eb311f17603c213eff4b60c63d00058d1e1608d3171a033e7716c16989728df2"],"state_sha256":"fa229c26368a191f379057b88acfc719052b6cd5123683e6ed7b514e299504a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDiXdDmywBm9UxXwUP2mau6BILvKGJ+f1Wl3/QDkP7Z6XLld/KGm3dGEGW9WnA97UCuPZvyB6qq4Smb2DUzXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:10:17.531824Z","bundle_sha256":"0133c8c9953ba6cb65c97caf8ca1a09ed950f191acfc49d046b89bad5a05b41a"}}