{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OUWFZBGJWTGUIEFD3KSXCUK6GK","short_pith_number":"pith:OUWFZBGJ","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"},"canonical_sha256":"752c5c84c9b4cd4410a3daa571515e32b074e0a36ab5a5982487b60a1e1948d9","source":{"kind":"arxiv","id":"1905.03953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03953","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03953v1","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03953","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"OUWFZBGJWTGU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OUWFZBGJWTGUIEFD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OUWFZBGJ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OUWFZBGJWTGUIEFD3KSXCUK6GK","target":"record","payload":{"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"},"canonical_sha256":"752c5c84c9b4cd4410a3daa571515e32b074e0a36ab5a5982487b60a1e1948d9","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"},"source_kind":"arxiv","source_id":"1905.03953","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-05-17T23:46:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3eSMmRrp57xc7qJKP0g4r98EgxP+7YYIhfHQB292CqLL5ZMlQIw3U1zyWJd1kyTEN57cQscHhV58pqqKLd2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:44:55.707522Z"},"content_sha256":"429d4d5812055ed2c96fa4fbd69b9f378d3639bb50a13792391c6bf30e0da073","schema_version":"1.0","event_id":"sha256:429d4d5812055ed2c96fa4fbd69b9f378d3639bb50a13792391c6bf30e0da073"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OUWFZBGJWTGUIEFD3KSXCUK6GK","target":"graph","payload":{"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"},"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-17T23:46:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LKXeU/tjnvN4p7GCA6sU22jOTyLVri1IZaELbjCItbnil4TYxhbM+v2fPxGU5c12ctDZDHSXhxAnFz2GKQ1DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:44:55.707870Z"},"content_sha256":"212cb00b118dc32151e81a7af4b9d589ab64bc964a6e9c181034b7b407c91703","schema_version":"1.0","event_id":"sha256:212cb00b118dc32151e81a7af4b9d589ab64bc964a6e9c181034b7b407c91703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/bundle.json","state_url":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/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-31T07:44:55Z","links":{"resolver":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK","bundle":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/bundle.json","state":"https://pith.science/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUWFZBGJWTGUIEFD3KSXCUK6GK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OUWFZBGJWTGUIEFD3KSXCUK6GK","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":"2fa51238f2c180c2c218eaf15b97260844388c9c3d671adeeaf8a7d3eb7d702c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-10T06:02:21Z","title_canon_sha256":"08b3fea8c226278aa88d30a4af883f6ff1eb35a7a4f3d1580c71a2d6d3395f04"},"schema_version":"1.0","source":{"id":"1905.03953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03953","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03953v1","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03953","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"OUWFZBGJWTGU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OUWFZBGJWTGUIEFD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OUWFZBGJ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:212cb00b118dc32151e81a7af4b9d589ab64bc964a6e9c181034b7b407c91703","target":"graph","created_at":"2026-05-17T23:46:35Z","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":"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","authors_text":"Adam Mammoliti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-10T06:02:21Z","title":"The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03953","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:429d4d5812055ed2c96fa4fbd69b9f378d3639bb50a13792391c6bf30e0da073","target":"record","created_at":"2026-05-17T23:46:35Z","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":"2fa51238f2c180c2c218eaf15b97260844388c9c3d671adeeaf8a7d3eb7d702c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-10T06:02:21Z","title_canon_sha256":"08b3fea8c226278aa88d30a4af883f6ff1eb35a7a4f3d1580c71a2d6d3395f04"},"schema_version":"1.0","source":{"id":"1905.03953","kind":"arxiv","version":1}},"canonical_sha256":"752c5c84c9b4cd4410a3daa571515e32b074e0a36ab5a5982487b60a1e1948d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"752c5c84c9b4cd4410a3daa571515e32b074e0a36ab5a5982487b60a1e1948d9","first_computed_at":"2026-05-17T23:46:35.073538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:35.073538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qmcfVxJQik572IQzfOjJa9+tiRO0kPvRvdmwUUwkAdJ9UUIVFrTIyC0SpGmARxcHk7sUzKkh/xIGFZgzLgIhAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:35.074216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:429d4d5812055ed2c96fa4fbd69b9f378d3639bb50a13792391c6bf30e0da073","sha256:212cb00b118dc32151e81a7af4b9d589ab64bc964a6e9c181034b7b407c91703"],"state_sha256":"0ac97527b858a5ef0889f91772a2973f2529880385b2b04380cb663444daca23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFXz0+4hrH0K3KFr00WLbi/PduX3swKF+AoxzZRucFbdQFGukFIZZkDg5bGschFbPVCnoL41ZCAaMBSuRrx5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:44:55.709937Z","bundle_sha256":"302984863f641c6e64a76a55e69105360982da87149d458d89909cbb55417899"}}