{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:W5UJCMCTLPDPKW775XY7B4Q7XU","short_pith_number":"pith:W5UJCMCT","canonical_record":{"source":{"id":"1901.05179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T08:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"1b192e8e22c1a5eae7a4da04b0a0bd964cb64be6d03adee79d9a0219ba5bc7f9","abstract_canon_sha256":"298d883cd1f0d78f9e20bf1d54c7f00018287183b018013b55f3d10a8c2ff854"},"schema_version":"1.0"},"canonical_sha256":"b7689130535bc6f55bffedf1f0f21fbd0fdcd53e2568f94323219ef51a63cfde","source":{"kind":"arxiv","id":"1901.05179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05179","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05179v1","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05179","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"W5UJCMCTLPDP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"W5UJCMCTLPDPKW77","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"W5UJCMCT","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:W5UJCMCTLPDPKW775XY7B4Q7XU","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T08:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"1b192e8e22c1a5eae7a4da04b0a0bd964cb64be6d03adee79d9a0219ba5bc7f9","abstract_canon_sha256":"298d883cd1f0d78f9e20bf1d54c7f00018287183b018013b55f3d10a8c2ff854"},"schema_version":"1.0"},"canonical_sha256":"b7689130535bc6f55bffedf1f0f21fbd0fdcd53e2568f94323219ef51a63cfde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:11.637807Z","signature_b64":"heYdUm+aMS1HOL+yrMOaT53gqhhCSaZ+i5A9zacH3cQk5XxHqV0hPIdJPwpaFHDOXLlmxbhJsfrwXbGag6r9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7689130535bc6f55bffedf1f0f21fbd0fdcd53e2568f94323219ef51a63cfde","last_reissued_at":"2026-05-17T23:56:11.637140Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:11.637140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05179","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-17T23:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvX8XTXSSQQoPTNlUpm45ax9iKXlVFUGRvbuwew2G8CCE/c9zt7xQ6pkRRascSZD8UgDLcRFpmV1iVrbiyWHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:55:43.780174Z"},"content_sha256":"4f478cf61e205a20b999843858e0c0c71a1498d6dab912c821fd7558a1da9010","schema_version":"1.0","event_id":"sha256:4f478cf61e205a20b999843858e0c0c71a1498d6dab912c821fd7558a1da9010"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:W5UJCMCTLPDPKW775XY7B4Q7XU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Functional Representation for Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fu-Dong Wang, Gui-Song Xia, Marcello Pelillo, Nan Xue, Yipeng Zhang","submitted_at":"2019-01-16T08:46:21Z","abstract_excerpt":"Graph matching is an important and persistent problem in computer vision and pattern recognition for finding node-to-node correspondence between graph-structured data. However, as widely used, graph matching that incorporates pairwise constraints can be formulated as a quadratic assignment problem (QAP), which is NP-complete and results in intrinsic computational difficulties. In this paper, we present a functional representation for graph matching (FRGM) that aims to provide more geometric insights on the problem and reduce the space and time complexities of corresponding algorithms. To achie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05179","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-17T23:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+E3i3v9LvpiReMQ5/bJRvYMKlXUR3dF253PolvVH5vB/ZzU8Nw9EEXVlgG0qVRnJk7awSeEYKqKfS0SODE2GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:55:43.780537Z"},"content_sha256":"454af7cf74d37638bdff94a82749c73beeb49b57a532c5e229d558f498d87339","schema_version":"1.0","event_id":"sha256:454af7cf74d37638bdff94a82749c73beeb49b57a532c5e229d558f498d87339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5UJCMCTLPDPKW775XY7B4Q7XU/bundle.json","state_url":"https://pith.science/pith/W5UJCMCTLPDPKW775XY7B4Q7XU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5UJCMCTLPDPKW775XY7B4Q7XU/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-01T19:55:43Z","links":{"resolver":"https://pith.science/pith/W5UJCMCTLPDPKW775XY7B4Q7XU","bundle":"https://pith.science/pith/W5UJCMCTLPDPKW775XY7B4Q7XU/bundle.json","state":"https://pith.science/pith/W5UJCMCTLPDPKW775XY7B4Q7XU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5UJCMCTLPDPKW775XY7B4Q7XU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:W5UJCMCTLPDPKW775XY7B4Q7XU","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":"298d883cd1f0d78f9e20bf1d54c7f00018287183b018013b55f3d10a8c2ff854","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T08:46:21Z","title_canon_sha256":"1b192e8e22c1a5eae7a4da04b0a0bd964cb64be6d03adee79d9a0219ba5bc7f9"},"schema_version":"1.0","source":{"id":"1901.05179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05179","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05179v1","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05179","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"W5UJCMCTLPDP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"W5UJCMCTLPDPKW77","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"W5UJCMCT","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:454af7cf74d37638bdff94a82749c73beeb49b57a532c5e229d558f498d87339","target":"graph","created_at":"2026-05-17T23:56:11Z","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":"Graph matching is an important and persistent problem in computer vision and pattern recognition for finding node-to-node correspondence between graph-structured data. However, as widely used, graph matching that incorporates pairwise constraints can be formulated as a quadratic assignment problem (QAP), which is NP-complete and results in intrinsic computational difficulties. In this paper, we present a functional representation for graph matching (FRGM) that aims to provide more geometric insights on the problem and reduce the space and time complexities of corresponding algorithms. To achie","authors_text":"Fu-Dong Wang, Gui-Song Xia, Marcello Pelillo, Nan Xue, Yipeng Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T08:46:21Z","title":"A Functional Representation for Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05179","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:4f478cf61e205a20b999843858e0c0c71a1498d6dab912c821fd7558a1da9010","target":"record","created_at":"2026-05-17T23:56:11Z","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":"298d883cd1f0d78f9e20bf1d54c7f00018287183b018013b55f3d10a8c2ff854","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T08:46:21Z","title_canon_sha256":"1b192e8e22c1a5eae7a4da04b0a0bd964cb64be6d03adee79d9a0219ba5bc7f9"},"schema_version":"1.0","source":{"id":"1901.05179","kind":"arxiv","version":1}},"canonical_sha256":"b7689130535bc6f55bffedf1f0f21fbd0fdcd53e2568f94323219ef51a63cfde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7689130535bc6f55bffedf1f0f21fbd0fdcd53e2568f94323219ef51a63cfde","first_computed_at":"2026-05-17T23:56:11.637140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:11.637140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"heYdUm+aMS1HOL+yrMOaT53gqhhCSaZ+i5A9zacH3cQk5XxHqV0hPIdJPwpaFHDOXLlmxbhJsfrwXbGag6r9Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:11.637807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f478cf61e205a20b999843858e0c0c71a1498d6dab912c821fd7558a1da9010","sha256:454af7cf74d37638bdff94a82749c73beeb49b57a532c5e229d558f498d87339"],"state_sha256":"d06c721ef3c836b9fa74b826288ef2ce4cdf6b29ebf9dac1d45d75c9ae6c257b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RWTMkqy0VUQgzcyTP/1iGmgda4PMkQ940XPASve/imgz3cEBYkugIveg1fvyuni0yrumk1AynkoRUHA8VyBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:55:43.782433Z","bundle_sha256":"08674f07555ac4d62125cfe9ccf856c5d0f95afb83abb355d87a4d0161b016cc"}}