{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OPHQFCT2CSZCV3BYG36SN5X4TJ","short_pith_number":"pith:OPHQFCT2","canonical_record":{"source":{"id":"1608.01521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T12:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"58475645446fa3ffe0fe510a0d61c42583c6d41c1da2aafd4fc0c3fd08c80e40","abstract_canon_sha256":"498f9b7e1d97ff809f64ecc41329fcba53863c5eac4d55e81f5b1c32e6687522"},"schema_version":"1.0"},"canonical_sha256":"73cf028a7a14b22aec3836fd26f6fc9a5c1ba462780b08429d2e1628b1547b0b","source":{"kind":"arxiv","id":"1608.01521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01521","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01521v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01521","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"OPHQFCT2CSZC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPHQFCT2CSZCV3BY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPHQFCT2","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OPHQFCT2CSZCV3BYG36SN5X4TJ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T12:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"58475645446fa3ffe0fe510a0d61c42583c6d41c1da2aafd4fc0c3fd08c80e40","abstract_canon_sha256":"498f9b7e1d97ff809f64ecc41329fcba53863c5eac4d55e81f5b1c32e6687522"},"schema_version":"1.0"},"canonical_sha256":"73cf028a7a14b22aec3836fd26f6fc9a5c1ba462780b08429d2e1628b1547b0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:52.243203Z","signature_b64":"nNpx3FcAzY9Tn95ITuY0kxgxI+/ED4UAhxaBwCBCY6RDh52M4LBS/Op9PNmP1hSdLRiNEzbOrBKpk8+hK6ZxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73cf028a7a14b22aec3836fd26f6fc9a5c1ba462780b08429d2e1628b1547b0b","last_reissued_at":"2026-05-18T01:09:52.242574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:52.242574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01521","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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seu8VNSFd6CVWka3o8dcc11pgKkU8o46/I7dQwxirH2mufy1C7dpseP9ze9cdM1Sc/MSN1A2ksgpdv6B3BqwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:39:50.402232Z"},"content_sha256":"e47a3c1ca1fdd112a3cbad4caffa7dd81b2e9b307e134b11eceb95b8dc1b0652","schema_version":"1.0","event_id":"sha256:e47a3c1ca1fdd112a3cbad4caffa7dd81b2e9b307e134b11eceb95b8dc1b0652"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OPHQFCT2CSZCV3BYG36SN5X4TJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The sandpile model on K_{m,n} and the rank of its configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michele D'Adderio, Yvan Le Borgne","submitted_at":"2016-08-04T12:56:23Z","abstract_excerpt":"We present an algorithm to compute the rank of a configuration of the sandpile model for the complete bipartite graph K_{m,n} of complexity O(m+n). Furthermore, we provide a formula for the generating function of parking sorted configurations on complete bipartite graphs K_{m,n} according to rank, degree, and the sizes m and n.\n  The results in the present paper are similar to those found by Robert Cori and the second named author for the complete graph K_{n+1}, and they rely on the analysis of certain operators on the stable sorted configurations of K_{m,n} developed in a previous work by the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01521","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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BW0sm//4i1XP1GlXgz4NJ+huQhSKLai+G0+gnOKamVsP3TVbgxtT2OEAQh1VR00wlXUH5KLgyjYygcTxyBPSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:39:50.402602Z"},"content_sha256":"a70b1ae43a8dbf5753cfd3063c551ccfa9e757bcc351d92b241ef740637ddc8a","schema_version":"1.0","event_id":"sha256:a70b1ae43a8dbf5753cfd3063c551ccfa9e757bcc351d92b241ef740637ddc8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ/bundle.json","state_url":"https://pith.science/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ/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-01T18:39:50Z","links":{"resolver":"https://pith.science/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ","bundle":"https://pith.science/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ/bundle.json","state":"https://pith.science/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPHQFCT2CSZCV3BYG36SN5X4TJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OPHQFCT2CSZCV3BYG36SN5X4TJ","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":"498f9b7e1d97ff809f64ecc41329fcba53863c5eac4d55e81f5b1c32e6687522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T12:56:23Z","title_canon_sha256":"58475645446fa3ffe0fe510a0d61c42583c6d41c1da2aafd4fc0c3fd08c80e40"},"schema_version":"1.0","source":{"id":"1608.01521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01521","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01521v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01521","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"OPHQFCT2CSZC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPHQFCT2CSZCV3BY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPHQFCT2","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a70b1ae43a8dbf5753cfd3063c551ccfa9e757bcc351d92b241ef740637ddc8a","target":"graph","created_at":"2026-05-18T01:09:52Z","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":"We present an algorithm to compute the rank of a configuration of the sandpile model for the complete bipartite graph K_{m,n} of complexity O(m+n). Furthermore, we provide a formula for the generating function of parking sorted configurations on complete bipartite graphs K_{m,n} according to rank, degree, and the sizes m and n.\n  The results in the present paper are similar to those found by Robert Cori and the second named author for the complete graph K_{n+1}, and they rely on the analysis of certain operators on the stable sorted configurations of K_{m,n} developed in a previous work by the","authors_text":"Michele D'Adderio, Yvan Le Borgne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T12:56:23Z","title":"The sandpile model on K_{m,n} and the rank of its configurations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01521","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:e47a3c1ca1fdd112a3cbad4caffa7dd81b2e9b307e134b11eceb95b8dc1b0652","target":"record","created_at":"2026-05-18T01:09:52Z","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":"498f9b7e1d97ff809f64ecc41329fcba53863c5eac4d55e81f5b1c32e6687522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T12:56:23Z","title_canon_sha256":"58475645446fa3ffe0fe510a0d61c42583c6d41c1da2aafd4fc0c3fd08c80e40"},"schema_version":"1.0","source":{"id":"1608.01521","kind":"arxiv","version":1}},"canonical_sha256":"73cf028a7a14b22aec3836fd26f6fc9a5c1ba462780b08429d2e1628b1547b0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73cf028a7a14b22aec3836fd26f6fc9a5c1ba462780b08429d2e1628b1547b0b","first_computed_at":"2026-05-18T01:09:52.242574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:52.242574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nNpx3FcAzY9Tn95ITuY0kxgxI+/ED4UAhxaBwCBCY6RDh52M4LBS/Op9PNmP1hSdLRiNEzbOrBKpk8+hK6ZxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:52.243203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e47a3c1ca1fdd112a3cbad4caffa7dd81b2e9b307e134b11eceb95b8dc1b0652","sha256:a70b1ae43a8dbf5753cfd3063c551ccfa9e757bcc351d92b241ef740637ddc8a"],"state_sha256":"9f66d73a37c594f91439175c8017a2a361354d739457375ef1f2c57e31f081ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoZXhBsTQZXZR+lExWjDrDBLhWYyQcATM3XsszwNs4p7DwmZDbtHji826QAgzr5X0WxXVeMNnVh3AUf1pDjwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:39:50.405090Z","bundle_sha256":"685617e7945379f33ad2481d95cd1ea47b6cbb45ff5d1af7f42760fc83e107d1"}}