{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F7TQBGQ3SINUUJVI763KFBDJZ5","short_pith_number":"pith:F7TQBGQ3","canonical_record":{"source":{"id":"1804.03715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T20:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"49acfbfe8a650803f252d4b3e593b33aeadcad8d7b2cde7240e2e815c7839550","abstract_canon_sha256":"1274b3d2c27301508d28137938bc91f457bcf6d023f271dc6d17f3feb6de57cd"},"schema_version":"1.0"},"canonical_sha256":"2fe7009a1b921b4a26a8ffb6a28469cf6f50e3869f9f46b7ee05682e68c3be8a","source":{"kind":"arxiv","id":"1804.03715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03715","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03715v1","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03715","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"F7TQBGQ3SINU","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F7TQBGQ3SINUUJVI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F7TQBGQ3","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F7TQBGQ3SINUUJVI763KFBDJZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T20:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"49acfbfe8a650803f252d4b3e593b33aeadcad8d7b2cde7240e2e815c7839550","abstract_canon_sha256":"1274b3d2c27301508d28137938bc91f457bcf6d023f271dc6d17f3feb6de57cd"},"schema_version":"1.0"},"canonical_sha256":"2fe7009a1b921b4a26a8ffb6a28469cf6f50e3869f9f46b7ee05682e68c3be8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.217812Z","signature_b64":"VbpL4mnRHPuX3yteM7CZoXfwoglPHTpClXCewqk0xUl4mCOEOpKxv5PA6h23IqdRIJXQCnxLf/wAIVuHcP9ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe7009a1b921b4a26a8ffb6a28469cf6f50e3869f9f46b7ee05682e68c3be8a","last_reissued_at":"2026-05-18T00:18:45.217186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.217186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03715","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:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y87WZTRgsW56KK/XaRpOENHOcqagQKkA+dPt4+TSavbF8AWbfKw7MzFiCEVR5VHtU8V6YXuY+g44bRMk2N5EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:07:17.312177Z"},"content_sha256":"04128d5c69166a172ef12d3ec83804e75b0a966de7adab72bbb02b44e90dab17","schema_version":"1.0","event_id":"sha256:04128d5c69166a172ef12d3ec83804e75b0a966de7adab72bbb02b44e90dab17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F7TQBGQ3SINUUJVI763KFBDJZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Matching with Anchor Nodes: A Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Leonidas Guibas, Nan Hu, Raif M. Rustamov","submitted_at":"2018-04-10T20:49:50Z","abstract_excerpt":"In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes. Our construction exploits recently introduced node signatures based on graph Laplacians, namely the Laplacian family signature (LFS) on the nodes, and the pairwise heat kernel map on the edges. In this paper, without assuming an explicit form of parametric dependence nor a distance metric between node signatures, we formulate an optimization problem which incorporates the knowledge of anchor nodes. Solving this problem gives us an optimized proximity measure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03715","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:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wh3vShvOtoPKq5q2N4lGdVOo/gu/ans16CZPZ8LDAGBit7GKUW3Wa/sSlxmFBwNneXNUNyKqLgZ9YlRxbjTeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:07:17.312743Z"},"content_sha256":"f2f482ec04ff9804135099438915440ca62bf1c6dbc0c8f2d178679d888b5de1","schema_version":"1.0","event_id":"sha256:f2f482ec04ff9804135099438915440ca62bf1c6dbc0c8f2d178679d888b5de1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7TQBGQ3SINUUJVI763KFBDJZ5/bundle.json","state_url":"https://pith.science/pith/F7TQBGQ3SINUUJVI763KFBDJZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7TQBGQ3SINUUJVI763KFBDJZ5/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-06-03T00:07:17Z","links":{"resolver":"https://pith.science/pith/F7TQBGQ3SINUUJVI763KFBDJZ5","bundle":"https://pith.science/pith/F7TQBGQ3SINUUJVI763KFBDJZ5/bundle.json","state":"https://pith.science/pith/F7TQBGQ3SINUUJVI763KFBDJZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7TQBGQ3SINUUJVI763KFBDJZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F7TQBGQ3SINUUJVI763KFBDJZ5","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":"1274b3d2c27301508d28137938bc91f457bcf6d023f271dc6d17f3feb6de57cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T20:49:50Z","title_canon_sha256":"49acfbfe8a650803f252d4b3e593b33aeadcad8d7b2cde7240e2e815c7839550"},"schema_version":"1.0","source":{"id":"1804.03715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03715","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03715v1","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03715","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"F7TQBGQ3SINU","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F7TQBGQ3SINUUJVI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F7TQBGQ3","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f2f482ec04ff9804135099438915440ca62bf1c6dbc0c8f2d178679d888b5de1","target":"graph","created_at":"2026-05-18T00:18:45Z","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":"In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes. Our construction exploits recently introduced node signatures based on graph Laplacians, namely the Laplacian family signature (LFS) on the nodes, and the pairwise heat kernel map on the edges. In this paper, without assuming an explicit form of parametric dependence nor a distance metric between node signatures, we formulate an optimization problem which incorporates the knowledge of anchor nodes. Solving this problem gives us an optimized proximity measure","authors_text":"Leonidas Guibas, Nan Hu, Raif M. Rustamov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T20:49:50Z","title":"Graph Matching with Anchor Nodes: A Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03715","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:04128d5c69166a172ef12d3ec83804e75b0a966de7adab72bbb02b44e90dab17","target":"record","created_at":"2026-05-18T00:18:45Z","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":"1274b3d2c27301508d28137938bc91f457bcf6d023f271dc6d17f3feb6de57cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T20:49:50Z","title_canon_sha256":"49acfbfe8a650803f252d4b3e593b33aeadcad8d7b2cde7240e2e815c7839550"},"schema_version":"1.0","source":{"id":"1804.03715","kind":"arxiv","version":1}},"canonical_sha256":"2fe7009a1b921b4a26a8ffb6a28469cf6f50e3869f9f46b7ee05682e68c3be8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fe7009a1b921b4a26a8ffb6a28469cf6f50e3869f9f46b7ee05682e68c3be8a","first_computed_at":"2026-05-18T00:18:45.217186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.217186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VbpL4mnRHPuX3yteM7CZoXfwoglPHTpClXCewqk0xUl4mCOEOpKxv5PA6h23IqdRIJXQCnxLf/wAIVuHcP9ABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.217812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04128d5c69166a172ef12d3ec83804e75b0a966de7adab72bbb02b44e90dab17","sha256:f2f482ec04ff9804135099438915440ca62bf1c6dbc0c8f2d178679d888b5de1"],"state_sha256":"26fde07456d7897bbd7d05a9a80e3d5a557483e1454466045da113c2ea2d9cdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kol2hPIMTYMHKWUITKNXIQp/sxVHY1fh/wPuqvrBt+6F+yIgB2o5kvtIrBE/vFNM4QN1Qwpu79fRg5xXvPi0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:07:17.315472Z","bundle_sha256":"468de3b201847035f16d0c7ef862de259f801896cbc6b32b100bf19e3e3c3241"}}