{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:I6SA6EHJJN7VVYN5JBQC24L5EK","short_pith_number":"pith:I6SA6EHJ","canonical_record":{"source":{"id":"2410.23932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T13:43:56Z","cross_cats_sorted":[],"title_canon_sha256":"ca5ba074e358aa757dfd6e7eed3016a2990e63636ab2acce2b9e45942bc5b368","abstract_canon_sha256":"c1c25916071aeeddd228d7d122be063cab5ca9e0ff2d0cf4be6f3a4cdf73aa21"},"schema_version":"1.0"},"canonical_sha256":"47a40f10e94b7f5ae1bd48602d717d22a1271d720ccb265cfc970a42ff96246e","source":{"kind":"arxiv","id":"2410.23932","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23932","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23932v1","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23932","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"pith_short_12","alias_value":"I6SA6EHJJN7V","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"I6SA6EHJJN7VVYN5","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"I6SA6EHJ","created_at":"2026-07-05T09:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:I6SA6EHJJN7VVYN5JBQC24L5EK","target":"record","payload":{"canonical_record":{"source":{"id":"2410.23932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T13:43:56Z","cross_cats_sorted":[],"title_canon_sha256":"ca5ba074e358aa757dfd6e7eed3016a2990e63636ab2acce2b9e45942bc5b368","abstract_canon_sha256":"c1c25916071aeeddd228d7d122be063cab5ca9e0ff2d0cf4be6f3a4cdf73aa21"},"schema_version":"1.0"},"canonical_sha256":"47a40f10e94b7f5ae1bd48602d717d22a1271d720ccb265cfc970a42ff96246e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:07.482172Z","signature_b64":"TKEhRMGGYw1pB5mjSXXktquVqlk0GKinHSj2A3sUGlwFiGj8Vdhu/FJCvRwNk/MdHb5Xz4rsM4sF9evrlwlyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a40f10e94b7f5ae1bd48602d717d22a1271d720ccb265cfc970a42ff96246e","last_reissued_at":"2026-07-05T09:29:07.481727Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:07.481727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.23932","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-07-05T09:29:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B614Mkdb32Eke1HKJPrhqSnADanG2NbT8BVtZn5Po5CbFsg9Uzxj5Ce5Mt3kwqFtMafI+s0j0GnDPrzcXlNuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:51:04.304086Z"},"content_sha256":"da0f5cb395190f8a39e9629b25225d7485daaad7c001c89e8c1d990deeaab79e","schema_version":"1.0","event_id":"sha256:da0f5cb395190f8a39e9629b25225d7485daaad7c001c89e8c1d990deeaab79e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:I6SA6EHJJN7VVYN5JBQC24L5EK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matroidal Cycles and Hypergraph Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patricija \\v{S}apokait\\.e, Ragnar Freij-Hollanti","submitted_at":"2024-10-31T13:43:56Z","abstract_excerpt":"We propose a novel definition of hypergraphical matroids, defined for arbitrary hypergraphs, simultaneously generalizing previous definitions for regular hypergraphs (Main, 1978), and for the hypergraphs of circuits of a matroid (Freij-Hollanti, Jurrius, Kuznetsova, 2023). As a consequence, we obtain a new notion of cycles in hypergraphs, and hypertrees. We give an equivalence relation on hypergraphs, according to when their so-called matroidal closures agree. Finally, we characterize hypergraphs that are isomorphic to the circuit hypergraphs of the associated matroids."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23932","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.23932/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-07-05T09:29:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0A/ftsWyBNQC2kPVP47W8nK8CQBzJZZ4xax5X1q3hc6t6WsdK0sSIA9FA4J2ZQXR2kB9+Atl3iJiDeaiWwzVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:51:04.304507Z"},"content_sha256":"8310b48f313917acc18410bed7a3f1b2d92a310e05aaebeabecc052f6aa13f9a","schema_version":"1.0","event_id":"sha256:8310b48f313917acc18410bed7a3f1b2d92a310e05aaebeabecc052f6aa13f9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6SA6EHJJN7VVYN5JBQC24L5EK/bundle.json","state_url":"https://pith.science/pith/I6SA6EHJJN7VVYN5JBQC24L5EK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6SA6EHJJN7VVYN5JBQC24L5EK/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-08-06T17:51:04Z","links":{"resolver":"https://pith.science/pith/I6SA6EHJJN7VVYN5JBQC24L5EK","bundle":"https://pith.science/pith/I6SA6EHJJN7VVYN5JBQC24L5EK/bundle.json","state":"https://pith.science/pith/I6SA6EHJJN7VVYN5JBQC24L5EK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6SA6EHJJN7VVYN5JBQC24L5EK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I6SA6EHJJN7VVYN5JBQC24L5EK","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":"c1c25916071aeeddd228d7d122be063cab5ca9e0ff2d0cf4be6f3a4cdf73aa21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T13:43:56Z","title_canon_sha256":"ca5ba074e358aa757dfd6e7eed3016a2990e63636ab2acce2b9e45942bc5b368"},"schema_version":"1.0","source":{"id":"2410.23932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23932","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23932v1","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23932","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"pith_short_12","alias_value":"I6SA6EHJJN7V","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"I6SA6EHJJN7VVYN5","created_at":"2026-07-05T09:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"I6SA6EHJ","created_at":"2026-07-05T09:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:8310b48f313917acc18410bed7a3f1b2d92a310e05aaebeabecc052f6aa13f9a","target":"graph","created_at":"2026-07-05T09:29:07Z","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/2410.23932/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel definition of hypergraphical matroids, defined for arbitrary hypergraphs, simultaneously generalizing previous definitions for regular hypergraphs (Main, 1978), and for the hypergraphs of circuits of a matroid (Freij-Hollanti, Jurrius, Kuznetsova, 2023). As a consequence, we obtain a new notion of cycles in hypergraphs, and hypertrees. We give an equivalence relation on hypergraphs, according to when their so-called matroidal closures agree. Finally, we characterize hypergraphs that are isomorphic to the circuit hypergraphs of the associated matroids.","authors_text":"Patricija \\v{S}apokait\\.e, Ragnar Freij-Hollanti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T13:43:56Z","title":"Matroidal Cycles and Hypergraph Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23932","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:da0f5cb395190f8a39e9629b25225d7485daaad7c001c89e8c1d990deeaab79e","target":"record","created_at":"2026-07-05T09:29:07Z","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":"c1c25916071aeeddd228d7d122be063cab5ca9e0ff2d0cf4be6f3a4cdf73aa21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T13:43:56Z","title_canon_sha256":"ca5ba074e358aa757dfd6e7eed3016a2990e63636ab2acce2b9e45942bc5b368"},"schema_version":"1.0","source":{"id":"2410.23932","kind":"arxiv","version":1}},"canonical_sha256":"47a40f10e94b7f5ae1bd48602d717d22a1271d720ccb265cfc970a42ff96246e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47a40f10e94b7f5ae1bd48602d717d22a1271d720ccb265cfc970a42ff96246e","first_computed_at":"2026-07-05T09:29:07.481727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:29:07.481727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TKEhRMGGYw1pB5mjSXXktquVqlk0GKinHSj2A3sUGlwFiGj8Vdhu/FJCvRwNk/MdHb5Xz4rsM4sF9evrlwlyAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:29:07.482172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.23932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da0f5cb395190f8a39e9629b25225d7485daaad7c001c89e8c1d990deeaab79e","sha256:8310b48f313917acc18410bed7a3f1b2d92a310e05aaebeabecc052f6aa13f9a"],"state_sha256":"4c10ddbd745b59022d8452e6ac49ae73d78d3cfa6974524e8092a04ddb969cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ky/1I9u1rI+/3nHakPiGhUEO76MvOUkEEGXe4dGrYXy205TdTDHIg6DiRKNay4COg2VQUAFzD7gIg4tpiO6HDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T17:51:04.307388Z","bundle_sha256":"499c28e69db8ff8ba989e70eba008353d64469c65c0d61aa2eb25b2ce530981d"}}