{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WSX36BX33LRERUCTRLNBAKPWTZ","short_pith_number":"pith:WSX36BX3","canonical_record":{"source":{"id":"2411.01753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-04T02:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"8dae2fd1d823b02af917436cec555900a2ee335d255b751e826786bdd87c08e3","abstract_canon_sha256":"48187edd5d8bbee44474f4143a54d4142ce1119e4c31aa0749adb532eb5318cd"},"schema_version":"1.0"},"canonical_sha256":"b4afbf06fbdae248d0538ada1029f69e6ec064463ece6dae638243eb2fcd2a1e","source":{"kind":"arxiv","id":"2411.01753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01753","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01753v2","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01753","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"WSX36BX33LRE","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"WSX36BX33LRERUCT","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"WSX36BX3","created_at":"2026-05-29T01:04:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WSX36BX33LRERUCTRLNBAKPWTZ","target":"record","payload":{"canonical_record":{"source":{"id":"2411.01753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-04T02:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"8dae2fd1d823b02af917436cec555900a2ee335d255b751e826786bdd87c08e3","abstract_canon_sha256":"48187edd5d8bbee44474f4143a54d4142ce1119e4c31aa0749adb532eb5318cd"},"schema_version":"1.0"},"canonical_sha256":"b4afbf06fbdae248d0538ada1029f69e6ec064463ece6dae638243eb2fcd2a1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:04:51.439112Z","signature_b64":"ig6goD2qX1XEPMTq9Ux5SYGMJ7K5+yoF99TVS8c0y4wtVPWPvED0cORBTMjW/wjzFOQlOzBajcqImG/0zoYwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4afbf06fbdae248d0538ada1029f69e6ec064463ece6dae638243eb2fcd2a1e","last_reissued_at":"2026-05-29T01:04:51.438555Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:04:51.438555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.01753","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-29T01:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZ45fGcvd++BDX5AfKuFQq/NrcsaVY6JM35GLzjFhvr3gYRGNkfS3+EaqzzeuRY6ihrDp63GpzMqzt7M5P6qDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:00:47.844591Z"},"content_sha256":"2b342512acbfd70ae5097cf308c3ecd3e6f5c0e95bdfc68976097c59b7ecb5b0","schema_version":"1.0","event_id":"sha256:2b342512acbfd70ae5097cf308c3ecd3e6f5c0e95bdfc68976097c59b7ecb5b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WSX36BX33LRERUCTRLNBAKPWTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some conjectures on $r$-graphs and equivalences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eckhard Steffen, Isaak H. Wolf, Junxue Zhang, Yulai Ma","submitted_at":"2024-11-04T02:31:35Z","abstract_excerpt":"An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Seymour [On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte.~\\emph{Proc.~London Math.~Soc.}~(3), 38(3): 423-460, 1979] conjectured (1) that every planar $r$-graph is $r$-edge colorable and (2) that every $r$-graph has $2r$ perfect matchings such that every edge is contained in precisely two of them. We study several variants of these conjectures.\n  A $(t,r)$-PM is a multiset of $t \\cdot r$ perfect matchings of an $r$-graph $G$ such that every edge is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01753","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.01753/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-29T01:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUpFBvkJsN5dOBeqarw6hSnUgSgR3Vkp1uF+gNK1N/WR2yuXkvZRszGZ0P4QWiCg9N5dcYB8kzNgHR+ktYfgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:00:47.844960Z"},"content_sha256":"f27348f62121418333ab676a468f5577b69e8d1541e21f3699dc27cd72c7fa34","schema_version":"1.0","event_id":"sha256:f27348f62121418333ab676a468f5577b69e8d1541e21f3699dc27cd72c7fa34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSX36BX33LRERUCTRLNBAKPWTZ/bundle.json","state_url":"https://pith.science/pith/WSX36BX33LRERUCTRLNBAKPWTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSX36BX33LRERUCTRLNBAKPWTZ/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-22T16:00:47Z","links":{"resolver":"https://pith.science/pith/WSX36BX33LRERUCTRLNBAKPWTZ","bundle":"https://pith.science/pith/WSX36BX33LRERUCTRLNBAKPWTZ/bundle.json","state":"https://pith.science/pith/WSX36BX33LRERUCTRLNBAKPWTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSX36BX33LRERUCTRLNBAKPWTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WSX36BX33LRERUCTRLNBAKPWTZ","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":"48187edd5d8bbee44474f4143a54d4142ce1119e4c31aa0749adb532eb5318cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-04T02:31:35Z","title_canon_sha256":"8dae2fd1d823b02af917436cec555900a2ee335d255b751e826786bdd87c08e3"},"schema_version":"1.0","source":{"id":"2411.01753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01753","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01753v2","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01753","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"WSX36BX33LRE","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"WSX36BX33LRERUCT","created_at":"2026-05-29T01:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"WSX36BX3","created_at":"2026-05-29T01:04:51Z"}],"graph_snapshots":[{"event_id":"sha256:f27348f62121418333ab676a468f5577b69e8d1541e21f3699dc27cd72c7fa34","target":"graph","created_at":"2026-05-29T01:04:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.01753/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Seymour [On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte.~\\emph{Proc.~London Math.~Soc.}~(3), 38(3): 423-460, 1979] conjectured (1) that every planar $r$-graph is $r$-edge colorable and (2) that every $r$-graph has $2r$ perfect matchings such that every edge is contained in precisely two of them. We study several variants of these conjectures.\n  A $(t,r)$-PM is a multiset of $t \\cdot r$ perfect matchings of an $r$-graph $G$ such that every edge is ","authors_text":"Eckhard Steffen, Isaak H. Wolf, Junxue Zhang, Yulai Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-04T02:31:35Z","title":"Some conjectures on $r$-graphs and equivalences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01753","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:2b342512acbfd70ae5097cf308c3ecd3e6f5c0e95bdfc68976097c59b7ecb5b0","target":"record","created_at":"2026-05-29T01:04:51Z","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":"48187edd5d8bbee44474f4143a54d4142ce1119e4c31aa0749adb532eb5318cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-04T02:31:35Z","title_canon_sha256":"8dae2fd1d823b02af917436cec555900a2ee335d255b751e826786bdd87c08e3"},"schema_version":"1.0","source":{"id":"2411.01753","kind":"arxiv","version":2}},"canonical_sha256":"b4afbf06fbdae248d0538ada1029f69e6ec064463ece6dae638243eb2fcd2a1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4afbf06fbdae248d0538ada1029f69e6ec064463ece6dae638243eb2fcd2a1e","first_computed_at":"2026-05-29T01:04:51.438555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:04:51.438555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ig6goD2qX1XEPMTq9Ux5SYGMJ7K5+yoF99TVS8c0y4wtVPWPvED0cORBTMjW/wjzFOQlOzBajcqImG/0zoYwBg==","signature_status":"signed_v1","signed_at":"2026-05-29T01:04:51.439112Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.01753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b342512acbfd70ae5097cf308c3ecd3e6f5c0e95bdfc68976097c59b7ecb5b0","sha256:f27348f62121418333ab676a468f5577b69e8d1541e21f3699dc27cd72c7fa34"],"state_sha256":"672db2927de657b1b318d8a21ea1bba9e2244551f6a6b9e83bd1690010fe8629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0Qm7kdFIiKW31mfpUpAPB4WjgBiSBuo8G8NTiL3Mxl6024SrNefsbgjiBYLyywMdhy7zeNJayEeRoXvndXfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:00:47.846972Z","bundle_sha256":"e01c2b5b47275079aa820ba54ea24b05b5d67c100c1bf79311ab2fec89e47a77"}}