{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P6MDT77K2K5IJ6B4SVXC5U3RHF","short_pith_number":"pith:P6MDT77K","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"},"canonical_sha256":"7f9839ffead2ba84f83c956e2ed37139471d44a1c55a087d6150438fe97a771b","source":{"kind":"arxiv","id":"1406.0941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0941","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0941v1","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0941","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"P6MDT77K2K5I","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6MDT77K2K5IJ6B4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6MDT77K","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P6MDT77K2K5IJ6B4SVXC5U3RHF","target":"record","payload":{"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"},"canonical_sha256":"7f9839ffead2ba84f83c956e2ed37139471d44a1c55a087d6150438fe97a771b","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"},"source_kind":"arxiv","source_id":"1406.0941","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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p44JjoOOEnvN9v+FFw158juuOJqj9/aoeyAHYs1QCfQJpLYBOqbR5/pVFARp1ZmPgic3pf3e9mJfrZXIK+fnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:19:55.367976Z"},"content_sha256":"bc1f371a81866b0c462783a20fa15889593efb4a2f5b396f93682a26073890b8","schema_version":"1.0","event_id":"sha256:bc1f371a81866b0c462783a20fa15889593efb4a2f5b396f93682a26073890b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P6MDT77K2K5IJ6B4SVXC5U3RHF","target":"graph","payload":{"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"},"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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGOmIlSGjarZW8LQupCwXZbZ4149qQRWlvAJqeyX+n0FLrOUtA7/MyNoHHhFrBXGlaC7DkBP644U8VREUhGnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:19:55.368652Z"},"content_sha256":"fbf3c9957c36a60450c35d38e7700b60b91f40992f6df63b87fc4f9a56103c92","schema_version":"1.0","event_id":"sha256:fbf3c9957c36a60450c35d38e7700b60b91f40992f6df63b87fc4f9a56103c92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/bundle.json","state_url":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/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-08T04:19:55Z","links":{"resolver":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF","bundle":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/bundle.json","state":"https://pith.science/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6MDT77K2K5IJ6B4SVXC5U3RHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P6MDT77K2K5IJ6B4SVXC5U3RHF","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":"e32207baa3534ab1ecc89ca0fe709a2335382a3d6519117eeef313c37b4de2e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-04T05:08:17Z","title_canon_sha256":"a5d570b519ab6df8ff65c323d349dc42f2383dbb0c9d48636a8618cdb62aaff5"},"schema_version":"1.0","source":{"id":"1406.0941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0941","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0941v1","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0941","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"P6MDT77K2K5I","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6MDT77K2K5IJ6B4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6MDT77K","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:fbf3c9957c36a60450c35d38e7700b60b91f40992f6df63b87fc4f9a56103c92","target":"graph","created_at":"2026-05-18T01:35:01Z","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":"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","authors_text":"Reihaneh Rabbany, Russell Greiner, Siamak Ravanbakhsh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-04T05:08:17Z","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0941","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:bc1f371a81866b0c462783a20fa15889593efb4a2f5b396f93682a26073890b8","target":"record","created_at":"2026-05-18T01:35:01Z","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":"e32207baa3534ab1ecc89ca0fe709a2335382a3d6519117eeef313c37b4de2e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-04T05:08:17Z","title_canon_sha256":"a5d570b519ab6df8ff65c323d349dc42f2383dbb0c9d48636a8618cdb62aaff5"},"schema_version":"1.0","source":{"id":"1406.0941","kind":"arxiv","version":1}},"canonical_sha256":"7f9839ffead2ba84f83c956e2ed37139471d44a1c55a087d6150438fe97a771b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f9839ffead2ba84f83c956e2ed37139471d44a1c55a087d6150438fe97a771b","first_computed_at":"2026-05-18T01:35:01.050724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:01.050724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T3MVX7181+4U+ov8PGKYQAOwHXfNhm6/pRHqVkj8pXlk8PxjatWmDtQLOIlb1mZV2pJcy9bxmhynraBs3UnhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:01.051408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc1f371a81866b0c462783a20fa15889593efb4a2f5b396f93682a26073890b8","sha256:fbf3c9957c36a60450c35d38e7700b60b91f40992f6df63b87fc4f9a56103c92"],"state_sha256":"9e6e5838f1d28ad23143d8221a3609b8f1cbff13a587c8d10b6119f5722bb49e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ka5fL374pZWdopt3BVeVe7iikZe1O/IkupfsZSQK3XEVP81t1X4+ijbj/HMwhcdMA8oqPqP7T90hJ1sb3ErLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:19:55.372705Z","bundle_sha256":"d7dd8df795a819933371223b2d318614dabbc35638393a1775af38da08bb10e7"}}