{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G34GUCFWS2KL3PJJPB3MZFDXDU","short_pith_number":"pith:G34GUCFW","schema_version":"1.0","canonical_sha256":"36f86a08b69694bdbd297876cc94771d29efef78b100485c8abc3bfdfc1991d4","source":{"kind":"arxiv","id":"2403.12713","version":1},"attestation_state":"computed","paper":{"title":"Spanning Euler Tours in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amin Bahmanian, Songling Shan","submitted_at":"2024-03-19T13:21:08Z","abstract_excerpt":"Motivated by generalizations of de Bruijn cycles to various combinatorial structures (Chung, Diaconis, and Graham), we study various Euler tours in set systems. Let $\\mathcal{G}$ be a hypergraph whose corank and rank are $c\\geq 3$ and $k$, respetively. The minimum $t$-degree of $\\mathcal{G}$ is the fewest number of edges containing every $t$-subset of vertices. An Euler tour (family, respectively) in $\\mathcal{G}$ is a (family of, respectively) closed walk(s) that (jointly, respectively) traverses each edge of $\\mathcal{G}$ exactly once. An Euler tour is spanning if it traverses all the vertic"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.12713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-19T13:21:08Z","cross_cats_sorted":[],"title_canon_sha256":"d9f8d5973adc11580392f65d21a6bf5026f7581bb5056a5c814967050cccdca8","abstract_canon_sha256":"d0122979e0196be5bd4e2ba03e3d947890c22eeb04cba5dfd28108d1bda2c4b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:05.831546Z","signature_b64":"QHhoX6c5INpos1/m+a/zrAEfvbu6Bf2fdSCoOgPLBdoWYy96m/5W8g9F9rKH5wf4PgJL+6l7efYUjGK4l7GyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f86a08b69694bdbd297876cc94771d29efef78b100485c8abc3bfdfc1991d4","last_reissued_at":"2026-07-05T07:58:05.831107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:05.831107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning Euler Tours in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amin Bahmanian, Songling Shan","submitted_at":"2024-03-19T13:21:08Z","abstract_excerpt":"Motivated by generalizations of de Bruijn cycles to various combinatorial structures (Chung, Diaconis, and Graham), we study various Euler tours in set systems. Let $\\mathcal{G}$ be a hypergraph whose corank and rank are $c\\geq 3$ and $k$, respetively. The minimum $t$-degree of $\\mathcal{G}$ is the fewest number of edges containing every $t$-subset of vertices. An Euler tour (family, respectively) in $\\mathcal{G}$ is a (family of, respectively) closed walk(s) that (jointly, respectively) traverses each edge of $\\mathcal{G}$ exactly once. An Euler tour is spanning if it traverses all the vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12713","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/2403.12713/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.12713","created_at":"2026-07-05T07:58:05.831162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12713v1","created_at":"2026-07-05T07:58:05.831162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12713","created_at":"2026-07-05T07:58:05.831162+00:00"},{"alias_kind":"pith_short_12","alias_value":"G34GUCFWS2KL","created_at":"2026-07-05T07:58:05.831162+00:00"},{"alias_kind":"pith_short_16","alias_value":"G34GUCFWS2KL3PJJ","created_at":"2026-07-05T07:58:05.831162+00:00"},{"alias_kind":"pith_short_8","alias_value":"G34GUCFW","created_at":"2026-07-05T07:58:05.831162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.13849","citing_title":"The Saxl hypergraph of a permutation group","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU","json":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU.json","graph_json":"https://pith.science/api/pith-number/G34GUCFWS2KL3PJJPB3MZFDXDU/graph.json","events_json":"https://pith.science/api/pith-number/G34GUCFWS2KL3PJJPB3MZFDXDU/events.json","paper":"https://pith.science/paper/G34GUCFW"},"agent_actions":{"view_html":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU","download_json":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU.json","view_paper":"https://pith.science/paper/G34GUCFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12713&json=true","fetch_graph":"https://pith.science/api/pith-number/G34GUCFWS2KL3PJJPB3MZFDXDU/graph.json","fetch_events":"https://pith.science/api/pith-number/G34GUCFWS2KL3PJJPB3MZFDXDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU/action/storage_attestation","attest_author":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU/action/author_attestation","sign_citation":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU/action/citation_signature","submit_replication":"https://pith.science/pith/G34GUCFWS2KL3PJJPB3MZFDXDU/action/replication_record"}},"created_at":"2026-07-05T07:58:05.831162+00:00","updated_at":"2026-07-05T07:58:05.831162+00:00"}