{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:P6MDT77K2K5IJ6B4SVXC5U3RHF","short_pith_number":"pith:P6MDT77K","schema_version":"1.0","canonical_sha256":"7f9839ffead2ba84f83c956e2ed37139471d44a1c55a087d6150438fe97a771b","source":{"kind":"arxiv","id":"1406.0941","version":1},"attestation_state":"computed","paper":{"title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Reihaneh Rabbany, Russell Greiner, Siamak Ravanbakhsh","submitted_at":"2014-06-04T05:08:17Z","abstract_excerpt":"The cutting plane method is an augmentative constrained optimization procedure that is often used with continuous-domain optimization techniques such as linear and convex programs. We investigate the viability of a similar idea within message passing -- which produces integral solutions -- in the context of two combinatorial problems: 1) For Traveling Salesman Problem (TSP), we propose a factor-graph based on Held-Karp formulation, with an exponential number of constraint factors, each of which has an exponential but sparse tabular form. 2) For graph-partitioning (a.k.a., community mining) usi"},"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":"1406.0941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-04T05:08:17Z","cross_cats_sorted":[],"title_canon_sha256":"a5d570b519ab6df8ff65c323d349dc42f2383dbb0c9d48636a8618cdb62aaff5","abstract_canon_sha256":"e32207baa3534ab1ecc89ca0fe709a2335382a3d6519117eeef313c37b4de2e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.051408Z","signature_b64":"T3MVX7181+4U+ov8PGKYQAOwHXfNhm6/pRHqVkj8pXlk8PxjatWmDtQLOIlb1mZV2pJcy9bxmhynraBs3UnhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9839ffead2ba84f83c956e2ed37139471d44a1c55a087d6150438fe97a771b","last_reissued_at":"2026-05-18T01:35:01.050724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.050724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Reihaneh Rabbany, Russell Greiner, Siamak Ravanbakhsh","submitted_at":"2014-06-04T05:08:17Z","abstract_excerpt":"The cutting plane method is an augmentative constrained optimization procedure that is often used with continuous-domain optimization techniques such as linear and convex programs. We investigate the viability of a similar idea within message passing -- which produces integral solutions -- in the context of two combinatorial problems: 1) For Traveling Salesman Problem (TSP), we propose a factor-graph based on Held-Karp formulation, with an exponential number of constraint factors, each of which has an exponential but sparse tabular form. 2) For graph-partitioning (a.k.a., community mining) usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0941","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":"1406.0941","created_at":"2026-05-18T01:35:01.050821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0941v1","created_at":"2026-05-18T01:35:01.050821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0941","created_at":"2026-05-18T01:35:01.050821+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6MDT77K2K5I","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6MDT77K2K5IJ6B4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6MDT77K","created_at":"2026-05-18T12:28:43.426989+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/P6MDT77K2K5IJ6B4SVXC5U3RHF","json":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF.json","graph_json":"https://pith.science/api/pith-number/P6MDT77K2K5IJ6B4SVXC5U3RHF/graph.json","events_json":"https://pith.science/api/pith-number/P6MDT77K2K5IJ6B4SVXC5U3RHF/events.json","paper":"https://pith.science/paper/P6MDT77K"},"agent_actions":{"view_html":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF","download_json":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF.json","view_paper":"https://pith.science/paper/P6MDT77K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0941&json=true","fetch_graph":"https://pith.science/api/pith-number/P6MDT77K2K5IJ6B4SVXC5U3RHF/graph.json","fetch_events":"https://pith.science/api/pith-number/P6MDT77K2K5IJ6B4SVXC5U3RHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/action/storage_attestation","attest_author":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/action/author_attestation","sign_citation":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/action/citation_signature","submit_replication":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/action/replication_record"}},"created_at":"2026-05-18T01:35:01.050821+00:00","updated_at":"2026-05-18T01:35:01.050821+00:00"}