{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CUUJFVDIYOBRFFYSGDW4ARPISQ","short_pith_number":"pith:CUUJFVDI","schema_version":"1.0","canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","source":{"kind":"arxiv","id":"1411.0763","version":1},"attestation_state":"computed","paper":{"title":"A Weighted Common Subgraph Matching Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Hong Qiao, Xu Yang, Zhi-yong Liu","submitted_at":"2014-11-04T02:39:46Z","abstract_excerpt":"We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices. Then it is approximately solved by a recently proposed combinatorial optimization framework - Graduated NonConvexity and Concavity Procedure (GNCCP). Experime"},"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":"1411.0763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T02:39:46Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"546853553a62b694c19c5a6f2feced0218da3ade87ba7ee4bbcd0a96a9c17feb","abstract_canon_sha256":"12ae730b4c320fe381c5088add44b7a3423798f608843fd25834551b5f50ca4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.309662Z","signature_b64":"3DAliHjBs7IqF0uNY3M04FcIsfpuIWvTJyUbf0njYCsOHb0UK6i0mQjbIQih3F9dEgtRCRbGSnVFlr2DQRUBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"152892d468c38312971230edc045e894338f8f4ba67a9ea7c30ffb2335c3e1b5","last_reissued_at":"2026-05-18T02:38:38.309267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.309267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Weighted Common Subgraph Matching Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Hong Qiao, Xu Yang, Zhi-yong Liu","submitted_at":"2014-11-04T02:39:46Z","abstract_excerpt":"We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices. Then it is approximately solved by a recently proposed combinatorial optimization framework - Graduated NonConvexity and Concavity Procedure (GNCCP). Experime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0763","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":"1411.0763","created_at":"2026-05-18T02:38:38.309328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0763v1","created_at":"2026-05-18T02:38:38.309328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0763","created_at":"2026-05-18T02:38:38.309328+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUUJFVDIYOBR","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUUJFVDIYOBRFFYS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUUJFVDI","created_at":"2026-05-18T12:28:25.294606+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/CUUJFVDIYOBRFFYSGDW4ARPISQ","json":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ.json","graph_json":"https://pith.science/api/pith-number/CUUJFVDIYOBRFFYSGDW4ARPISQ/graph.json","events_json":"https://pith.science/api/pith-number/CUUJFVDIYOBRFFYSGDW4ARPISQ/events.json","paper":"https://pith.science/paper/CUUJFVDI"},"agent_actions":{"view_html":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ","download_json":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ.json","view_paper":"https://pith.science/paper/CUUJFVDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0763&json=true","fetch_graph":"https://pith.science/api/pith-number/CUUJFVDIYOBRFFYSGDW4ARPISQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CUUJFVDIYOBRFFYSGDW4ARPISQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/action/storage_attestation","attest_author":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/action/author_attestation","sign_citation":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/action/citation_signature","submit_replication":"https://pith.science/pith/CUUJFVDIYOBRFFYSGDW4ARPISQ/action/replication_record"}},"created_at":"2026-05-18T02:38:38.309328+00:00","updated_at":"2026-05-18T02:38:38.309328+00:00"}