{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U34RAORD24E4PHTNPQWDG6MC5E","short_pith_number":"pith:U34RAORD","canonical_record":{"source":{"id":"1305.7319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-31T08:16:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c231d2427b09b8a3e367b4761ecd82c7d73b38c6fd9e0d6f17ea01d0cec471cf","abstract_canon_sha256":"e666581e13de1695d7d5caf2579a9cd7f7a5352bc0eae52e54441856b368b705"},"schema_version":"1.0"},"canonical_sha256":"a6f9103a23d709c79e6d7c2c337982e9020177d9c5ddca1d65bbb8dc118170d6","source":{"kind":"arxiv","id":"1305.7319","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7319","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7319v2","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7319","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"U34RAORD24E4","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U34RAORD24E4PHTN","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U34RAORD","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U34RAORD24E4PHTNPQWDG6MC5E","target":"record","payload":{"canonical_record":{"source":{"id":"1305.7319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-31T08:16:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c231d2427b09b8a3e367b4761ecd82c7d73b38c6fd9e0d6f17ea01d0cec471cf","abstract_canon_sha256":"e666581e13de1695d7d5caf2579a9cd7f7a5352bc0eae52e54441856b368b705"},"schema_version":"1.0"},"canonical_sha256":"a6f9103a23d709c79e6d7c2c337982e9020177d9c5ddca1d65bbb8dc118170d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:47.629692Z","signature_b64":"UUl06KJGRbJQYH8m9WmJRex5Fk7kz58EH2LVG9tXo87CQ3QvttKdcc90ec2By/2rOEqaNx2/f0pHCmtP/2wQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f9103a23d709c79e6d7c2c337982e9020177d9c5ddca1d65bbb8dc118170d6","last_reissued_at":"2026-05-18T03:10:47.628454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:47.628454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.7319","source_version":2,"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-18T03:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdUJDD/bol7EV3rrixFrTWVELo1VJNuBxleNp2CTViRh1l/vMinpy7rAzW1H/pOjwsM8ic7jWuNE9eYMsG20Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:51:00.579644Z"},"content_sha256":"f0288f40c6b3fd5b9c77e3aa382a677b458402887967e5a83bc9bdeea483cc1d","schema_version":"1.0","event_id":"sha256:f0288f40c6b3fd5b9c77e3aa382a677b458402887967e5a83bc9bdeea483cc1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U34RAORD24E4PHTNPQWDG6MC5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Handelman's hierarchy for the maximum stable set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Monique Laurent, Zhao Sun","submitted_at":"2013-05-31T08:16:56Z","abstract_excerpt":"The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope with non-empty interior can be represented as conic combination of products of the linear constraints defining the polytope. We relate the rank of Handelman's hierarchy with structural properties of graphs. In particular we show a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7319","kind":"arxiv","version":2},"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-18T03:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38iBRxoDJVhOun9SM1aqb0dkmWu3QLa0NNzyPtcT3YgxBOlPHAQ2RaURjZIL02LHi7U0cGNWI+rsfAz0xKnaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:51:00.579991Z"},"content_sha256":"bf85d22b19fd3abb4761cea82b7c720d033b45bd1d9b6be8997ae7617078c12c","schema_version":"1.0","event_id":"sha256:bf85d22b19fd3abb4761cea82b7c720d033b45bd1d9b6be8997ae7617078c12c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U34RAORD24E4PHTNPQWDG6MC5E/bundle.json","state_url":"https://pith.science/pith/U34RAORD24E4PHTNPQWDG6MC5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U34RAORD24E4PHTNPQWDG6MC5E/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-05-31T02:51:00Z","links":{"resolver":"https://pith.science/pith/U34RAORD24E4PHTNPQWDG6MC5E","bundle":"https://pith.science/pith/U34RAORD24E4PHTNPQWDG6MC5E/bundle.json","state":"https://pith.science/pith/U34RAORD24E4PHTNPQWDG6MC5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U34RAORD24E4PHTNPQWDG6MC5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U34RAORD24E4PHTNPQWDG6MC5E","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":"e666581e13de1695d7d5caf2579a9cd7f7a5352bc0eae52e54441856b368b705","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-31T08:16:56Z","title_canon_sha256":"c231d2427b09b8a3e367b4761ecd82c7d73b38c6fd9e0d6f17ea01d0cec471cf"},"schema_version":"1.0","source":{"id":"1305.7319","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7319","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7319v2","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7319","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"U34RAORD24E4","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U34RAORD24E4PHTN","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U34RAORD","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:bf85d22b19fd3abb4761cea82b7c720d033b45bd1d9b6be8997ae7617078c12c","target":"graph","created_at":"2026-05-18T03:10:47Z","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 maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope with non-empty interior can be represented as conic combination of products of the linear constraints defining the polytope. We relate the rank of Handelman's hierarchy with structural properties of graphs. In particular we show a re","authors_text":"Monique Laurent, Zhao Sun","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-31T08:16:56Z","title":"Handelman's hierarchy for the maximum stable set problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7319","kind":"arxiv","version":2},"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:f0288f40c6b3fd5b9c77e3aa382a677b458402887967e5a83bc9bdeea483cc1d","target":"record","created_at":"2026-05-18T03:10:47Z","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":"e666581e13de1695d7d5caf2579a9cd7f7a5352bc0eae52e54441856b368b705","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-31T08:16:56Z","title_canon_sha256":"c231d2427b09b8a3e367b4761ecd82c7d73b38c6fd9e0d6f17ea01d0cec471cf"},"schema_version":"1.0","source":{"id":"1305.7319","kind":"arxiv","version":2}},"canonical_sha256":"a6f9103a23d709c79e6d7c2c337982e9020177d9c5ddca1d65bbb8dc118170d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6f9103a23d709c79e6d7c2c337982e9020177d9c5ddca1d65bbb8dc118170d6","first_computed_at":"2026-05-18T03:10:47.628454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:47.628454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UUl06KJGRbJQYH8m9WmJRex5Fk7kz58EH2LVG9tXo87CQ3QvttKdcc90ec2By/2rOEqaNx2/f0pHCmtP/2wQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:47.629692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.7319","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0288f40c6b3fd5b9c77e3aa382a677b458402887967e5a83bc9bdeea483cc1d","sha256:bf85d22b19fd3abb4761cea82b7c720d033b45bd1d9b6be8997ae7617078c12c"],"state_sha256":"5f7a8969bd3d88ff741ea812426e1b5449da1d2b255392a767e91a52de0e0ec8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omPHZwTVL1NOQFwp2LNM7MpVCOkJGU9j1mdkIw/F3ba7yMIYwee61AEA+ZwvoUa/oGAhhZCdgv2iy5VvE5VgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:51:00.582069Z","bundle_sha256":"fd712eb6e9ff09bb37a98da837713384b76150efb9283d6eeb0ff2f819aa6989"}}