{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EVGZLMI2B2YP2F3PBKGE2MDBV3","short_pith_number":"pith:EVGZLMI2","canonical_record":{"source":{"id":"1706.02516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-06-08T11:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"8ccfccd252010b82e0fdabbb9d357f8c10995a2ebd3d3df11960b66ea33cb708","abstract_canon_sha256":"f9da70bdcf07c7d393b0e9624015ec4ab9a9a3b3ab343d440067b77c8825d264"},"schema_version":"1.0"},"canonical_sha256":"254d95b11a0eb0fd176f0a8c4d3061aec12b3953463da614ca729a545806e5a9","source":{"kind":"arxiv","id":"1706.02516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02516","created_at":"2026-05-18T00:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02516v1","created_at":"2026-05-18T00:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02516","created_at":"2026-05-18T00:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"EVGZLMI2B2YP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EVGZLMI2B2YP2F3P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EVGZLMI2","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EVGZLMI2B2YP2F3PBKGE2MDBV3","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-06-08T11:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"8ccfccd252010b82e0fdabbb9d357f8c10995a2ebd3d3df11960b66ea33cb708","abstract_canon_sha256":"f9da70bdcf07c7d393b0e9624015ec4ab9a9a3b3ab343d440067b77c8825d264"},"schema_version":"1.0"},"canonical_sha256":"254d95b11a0eb0fd176f0a8c4d3061aec12b3953463da614ca729a545806e5a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:45.242671Z","signature_b64":"NGN8AcBpZLBZ9Mbjs7DAop5Agkz994xEkC+HYrMGRlIEi/9s4wgknOcuEzj5Zv7+Gmpiuls4kVGliyoIyfF0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"254d95b11a0eb0fd176f0a8c4d3061aec12b3953463da614ca729a545806e5a9","last_reissued_at":"2026-05-18T00:42:45.242189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:45.242189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02516","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-18T00:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0807TnBM++un3Qi6lw1znFFPxYmmuDypVZnHKNhQrkpoJolsRVgwxfXKEiYVTL5YYbOgxysZinb7En9gNGoVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:43:47.396767Z"},"content_sha256":"8a72f2361b140d0a87418e6ae2f8830f8efd24f194c7aa4b9b29dd5c78ed326c","schema_version":"1.0","event_id":"sha256:8a72f2361b140d0a87418e6ae2f8830f8efd24f194c7aa4b9b29dd5c78ed326c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EVGZLMI2B2YP2F3PBKGE2MDBV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized cut and metric polytopes of graphs and simplicial complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Mathieu Dutour Sikiri\\'c, Michel Deza","submitted_at":"2017-06-08T11:15:35Z","abstract_excerpt":"Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5 is not a minor of G.\n  We consider possibly extensions of this framework: a) We compute the CUTP(G) and METP(G) for many graphs. b) We define the oriented cut polytope WOMCUTP(G) and oriented multicut polytope OMCUTP(G) as well as their oriented metric version QMETP(G) and WQMETP(G). c) We define an $n$-dimensional generalization of metric on simplicial compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02516","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-18T00:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQ8+ZyQJlmdnZCWqN12V5W3OPrzpBSq0IEj14VPl1VVXvJ/NxTHPElmPaNR4NZDFJ88kfgBgKK8zsj8jdTIHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:43:47.397471Z"},"content_sha256":"cce54cb469423c1cb790b88d297434c5fdc6ff488084f57b0a6144ebafa41cfb","schema_version":"1.0","event_id":"sha256:cce54cb469423c1cb790b88d297434c5fdc6ff488084f57b0a6144ebafa41cfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3/bundle.json","state_url":"https://pith.science/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3/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-11T01:43:47Z","links":{"resolver":"https://pith.science/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3","bundle":"https://pith.science/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3/bundle.json","state":"https://pith.science/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVGZLMI2B2YP2F3PBKGE2MDBV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EVGZLMI2B2YP2F3PBKGE2MDBV3","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":"f9da70bdcf07c7d393b0e9624015ec4ab9a9a3b3ab343d440067b77c8825d264","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-06-08T11:15:35Z","title_canon_sha256":"8ccfccd252010b82e0fdabbb9d357f8c10995a2ebd3d3df11960b66ea33cb708"},"schema_version":"1.0","source":{"id":"1706.02516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02516","created_at":"2026-05-18T00:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02516v1","created_at":"2026-05-18T00:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02516","created_at":"2026-05-18T00:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"EVGZLMI2B2YP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EVGZLMI2B2YP2F3P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EVGZLMI2","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:cce54cb469423c1cb790b88d297434c5fdc6ff488084f57b0a6144ebafa41cfb","target":"graph","created_at":"2026-05-18T00:42:45Z","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":"Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5 is not a minor of G.\n  We consider possibly extensions of this framework: a) We compute the CUTP(G) and METP(G) for many graphs. b) We define the oriented cut polytope WOMCUTP(G) and oriented multicut polytope OMCUTP(G) as well as their oriented metric version QMETP(G) and WQMETP(G). c) We define an $n$-dimensional generalization of metric on simplicial compl","authors_text":"Mathieu Dutour Sikiri\\'c, Michel Deza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-06-08T11:15:35Z","title":"Generalized cut and metric polytopes of graphs and simplicial complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02516","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:8a72f2361b140d0a87418e6ae2f8830f8efd24f194c7aa4b9b29dd5c78ed326c","target":"record","created_at":"2026-05-18T00:42:45Z","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":"f9da70bdcf07c7d393b0e9624015ec4ab9a9a3b3ab343d440067b77c8825d264","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-06-08T11:15:35Z","title_canon_sha256":"8ccfccd252010b82e0fdabbb9d357f8c10995a2ebd3d3df11960b66ea33cb708"},"schema_version":"1.0","source":{"id":"1706.02516","kind":"arxiv","version":1}},"canonical_sha256":"254d95b11a0eb0fd176f0a8c4d3061aec12b3953463da614ca729a545806e5a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"254d95b11a0eb0fd176f0a8c4d3061aec12b3953463da614ca729a545806e5a9","first_computed_at":"2026-05-18T00:42:45.242189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:45.242189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NGN8AcBpZLBZ9Mbjs7DAop5Agkz994xEkC+HYrMGRlIEi/9s4wgknOcuEzj5Zv7+Gmpiuls4kVGliyoIyfF0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:45.242671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a72f2361b140d0a87418e6ae2f8830f8efd24f194c7aa4b9b29dd5c78ed326c","sha256:cce54cb469423c1cb790b88d297434c5fdc6ff488084f57b0a6144ebafa41cfb"],"state_sha256":"a8e03df98d5a82f75bcd5c2ef0d9aa60a9e5b1be4f4e6dcf927948d9da17d7e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cscnWUSA6DWALJEEST2RM3N0tYrUNQekB/d5/BFTHU+Gbi/K+0kPlqtugpKmSiFmt4/ZffzS2Lce9Sz5r/HRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:43:47.402031Z","bundle_sha256":"da2bdd00b8e25151fed9045ab6c3fc1fbc6eccc38c756f0175ef3bd7a9d04704"}}