{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:I75CTLL6TCLBSQB2FOUI2GPMP3","short_pith_number":"pith:I75CTLL6","canonical_record":{"source":{"id":"1206.2512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-06-12T12:44:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"94c0be80e63d529f29039b03a19f3928dee12b7762a4a000789035591fb347af","abstract_canon_sha256":"6a6c826793e5b6784d2c7be1e2b16b990edc06a8d9810f49c17371e8acccb3c4"},"schema_version":"1.0"},"canonical_sha256":"47fa29ad7e989619403a2ba88d19ec7efea33060d04219a299cf03ffe8ea6c76","source":{"kind":"arxiv","id":"1206.2512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2512","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2512v2","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2512","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"I75CTLL6TCLB","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I75CTLL6TCLBSQB2","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I75CTLL6","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:I75CTLL6TCLBSQB2FOUI2GPMP3","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-06-12T12:44:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"94c0be80e63d529f29039b03a19f3928dee12b7762a4a000789035591fb347af","abstract_canon_sha256":"6a6c826793e5b6784d2c7be1e2b16b990edc06a8d9810f49c17371e8acccb3c4"},"schema_version":"1.0"},"canonical_sha256":"47fa29ad7e989619403a2ba88d19ec7efea33060d04219a299cf03ffe8ea6c76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:02.758358Z","signature_b64":"yIEEkeOo5x4jgpD0GujmbWqdzJcNWDojvF9d14I56TjPh6Kq3a6Jp/d+6REg7esaoUH02nCFBWx8RVWCwvANCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47fa29ad7e989619403a2ba88d19ec7efea33060d04219a299cf03ffe8ea6c76","last_reissued_at":"2026-05-18T03:38:02.757568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:02.757568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2512","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:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fq98P3LU05Hf8nDrYK8VBvhtwoIDO4CJZqprNuuo5EutMHK8YN1T/v+53asqTqQOp1dhfKjzbkXwR6p3yqXbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:21:47.068129Z"},"content_sha256":"554307ffb619324f9008438d886c80feb8b8f9d5378b90768c596b1d725086bb","schema_version":"1.0","event_id":"sha256:554307ffb619324f9008438d886c80feb8b8f9d5378b90768c596b1d725086bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:I75CTLL6TCLBSQB2FOUI2GPMP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial degree bound for toric ideals of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Elizabeth Gross, Sonja Petrovi\\'c","submitted_at":"2012-06-12T12:44:19Z","abstract_excerpt":"Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform hypergraphs in terms of balanced hypergraph bicolorings, separators, and splitting sets. In turn, this provides complexity bounds for algebraic statistical models associated to hypergraphs. As two main applications, we recover a well-known complexity result for Markov bases of arbitrary 3-way tables, and we show that the defining ideal of the tangential variety i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2512","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:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGseibUZimBqQ1Nb+MU4aAa9jYrveVbVGYHgNCvUr+nRsqSf3N9NSKhuQNG54TSAg3Cf3VwPLj9/3Qkcw4J8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:21:47.068680Z"},"content_sha256":"8d0e54aa2453fe89cc5a5949e95f4aa5b2ea3a32210ecd584c3a8d6361f8b4f5","schema_version":"1.0","event_id":"sha256:8d0e54aa2453fe89cc5a5949e95f4aa5b2ea3a32210ecd584c3a8d6361f8b4f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I75CTLL6TCLBSQB2FOUI2GPMP3/bundle.json","state_url":"https://pith.science/pith/I75CTLL6TCLBSQB2FOUI2GPMP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I75CTLL6TCLBSQB2FOUI2GPMP3/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-30T08:21:47Z","links":{"resolver":"https://pith.science/pith/I75CTLL6TCLBSQB2FOUI2GPMP3","bundle":"https://pith.science/pith/I75CTLL6TCLBSQB2FOUI2GPMP3/bundle.json","state":"https://pith.science/pith/I75CTLL6TCLBSQB2FOUI2GPMP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I75CTLL6TCLBSQB2FOUI2GPMP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:I75CTLL6TCLBSQB2FOUI2GPMP3","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":"6a6c826793e5b6784d2c7be1e2b16b990edc06a8d9810f49c17371e8acccb3c4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-06-12T12:44:19Z","title_canon_sha256":"94c0be80e63d529f29039b03a19f3928dee12b7762a4a000789035591fb347af"},"schema_version":"1.0","source":{"id":"1206.2512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2512","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2512v2","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2512","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"I75CTLL6TCLB","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I75CTLL6TCLBSQB2","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I75CTLL6","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:8d0e54aa2453fe89cc5a5949e95f4aa5b2ea3a32210ecd584c3a8d6361f8b4f5","target":"graph","created_at":"2026-05-18T03:38:02Z","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":"Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform hypergraphs in terms of balanced hypergraph bicolorings, separators, and splitting sets. In turn, this provides complexity bounds for algebraic statistical models associated to hypergraphs. As two main applications, we recover a well-known complexity result for Markov bases of arbitrary 3-way tables, and we show that the defining ideal of the tangential variety i","authors_text":"Elizabeth Gross, Sonja Petrovi\\'c","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-06-12T12:44:19Z","title":"Combinatorial degree bound for toric ideals of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2512","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:554307ffb619324f9008438d886c80feb8b8f9d5378b90768c596b1d725086bb","target":"record","created_at":"2026-05-18T03:38:02Z","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":"6a6c826793e5b6784d2c7be1e2b16b990edc06a8d9810f49c17371e8acccb3c4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-06-12T12:44:19Z","title_canon_sha256":"94c0be80e63d529f29039b03a19f3928dee12b7762a4a000789035591fb347af"},"schema_version":"1.0","source":{"id":"1206.2512","kind":"arxiv","version":2}},"canonical_sha256":"47fa29ad7e989619403a2ba88d19ec7efea33060d04219a299cf03ffe8ea6c76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47fa29ad7e989619403a2ba88d19ec7efea33060d04219a299cf03ffe8ea6c76","first_computed_at":"2026-05-18T03:38:02.757568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:02.757568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yIEEkeOo5x4jgpD0GujmbWqdzJcNWDojvF9d14I56TjPh6Kq3a6Jp/d+6REg7esaoUH02nCFBWx8RVWCwvANCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:02.758358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:554307ffb619324f9008438d886c80feb8b8f9d5378b90768c596b1d725086bb","sha256:8d0e54aa2453fe89cc5a5949e95f4aa5b2ea3a32210ecd584c3a8d6361f8b4f5"],"state_sha256":"05d93debf6930e6db233407c8404375a5bd1c27dfc8f6cb1c725e3b3ae4a0435"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQCIUfxqrk+mvwpywo/csi+hZhFEKwpLml6AWyl+3kBJpTftW2jNMkgOVQpTxg87KKJofpD/gC5UCEYJbW/eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:21:47.072460Z","bundle_sha256":"1e89ff6690fcd3a76aaf25214edb02c69512ad35f00d9f6a23cfc024825c5fb8"}}