{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OUWFZBGJWTGUIEFD3KSXCUK6GK","short_pith_number":"pith:OUWFZBGJ","schema_version":"1.0","canonical_sha256":"752c5c84c9b4cd4410a3daa571515e32b074e0a36ab5a5982487b60a1e1948d9","source":{"kind":"arxiv","id":"1905.03953","version":1},"attestation_state":"computed","paper":{"title":"The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti","submitted_at":"2019-05-10T06:02:21Z","abstract_excerpt":"Alspach [{\\sl Bull. Inst. Combin. Appl.}~{\\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$, denoted~$ms(G)$, to be the largest integer $s$ for which there is an ordering of the edges of $G$ such that every $s$ consecutive edges form a matching. In this paper, we consider the natural analogue for hypergraphs of this and related results and determine $ms(\\lambda\\mathcal{K}_{n_1,\\ldots, n_k})$ where $\\lambda\\mathcal{K}_{n_1,\\ldots, n_k}$ denotes the multi-$k$-partite $k$-graph with edge multiplicity $\\lambda$ and parts of sizes $n_1,\\ldots,n_k$, respectively. It t"},"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":"1905.03953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-10T06:02:21Z","cross_cats_sorted":[],"title_canon_sha256":"08b3fea8c226278aa88d30a4af883f6ff1eb35a7a4f3d1580c71a2d6d3395f04","abstract_canon_sha256":"2fa51238f2c180c2c218eaf15b97260844388c9c3d671adeeaf8a7d3eb7d702c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:35.074216Z","signature_b64":"qmcfVxJQik572IQzfOjJa9+tiRO0kPvRvdmwUUwkAdJ9UUIVFrTIyC0SpGmARxcHk7sUzKkh/xIGFZgzLgIhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"752c5c84c9b4cd4410a3daa571515e32b074e0a36ab5a5982487b60a1e1948d9","last_reissued_at":"2026-05-17T23:46:35.073538Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:35.073538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti","submitted_at":"2019-05-10T06:02:21Z","abstract_excerpt":"Alspach [{\\sl Bull. Inst. Combin. Appl.}~{\\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$, denoted~$ms(G)$, to be the largest integer $s$ for which there is an ordering of the edges of $G$ such that every $s$ consecutive edges form a matching. In this paper, we consider the natural analogue for hypergraphs of this and related results and determine $ms(\\lambda\\mathcal{K}_{n_1,\\ldots, n_k})$ where $\\lambda\\mathcal{K}_{n_1,\\ldots, n_k}$ denotes the multi-$k$-partite $k$-graph with edge multiplicity $\\lambda$ and parts of sizes $n_1,\\ldots,n_k$, respectively. It t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03953","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.03953","created_at":"2026-05-17T23:46:35.073644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03953v1","created_at":"2026-05-17T23:46:35.073644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03953","created_at":"2026-05-17T23:46:35.073644+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUWFZBGJWTGU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUWFZBGJWTGUIEFD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUWFZBGJ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK","json":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK.json","graph_json":"https://pith.science/api/pith-number/OUWFZBGJWTGUIEFD3KSXCUK6GK/graph.json","events_json":"https://pith.science/api/pith-number/OUWFZBGJWTGUIEFD3KSXCUK6GK/events.json","paper":"https://pith.science/paper/OUWFZBGJ"},"agent_actions":{"view_html":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK","download_json":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK.json","view_paper":"https://pith.science/paper/OUWFZBGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03953&json=true","fetch_graph":"https://pith.science/api/pith-number/OUWFZBGJWTGUIEFD3KSXCUK6GK/graph.json","fetch_events":"https://pith.science/api/pith-number/OUWFZBGJWTGUIEFD3KSXCUK6GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/action/storage_attestation","attest_author":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/action/author_attestation","sign_citation":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/action/citation_signature","submit_replication":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/action/replication_record"}},"created_at":"2026-05-17T23:46:35.073644+00:00","updated_at":"2026-05-17T23:46:35.073644+00:00"}