{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LZCHRCYMDMEK5ZT3KFFSFEKPGK","short_pith_number":"pith:LZCHRCYM","schema_version":"1.0","canonical_sha256":"5e44788b0c1b08aee67b514b22914f32a654ac90b4d48e3a7c56bfe28b7c2b9a","source":{"kind":"arxiv","id":"1705.07519","version":1},"attestation_state":"computed","paper":{"title":"Sandpile Groups of Random Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shaked Koplewitz","submitted_at":"2017-05-21T22:45:52Z","abstract_excerpt":"We determine the asymptotic distribution of the p-rank of the sandpile groups of random bipartite graphs. We see that this depends on the ratio between the number of vertices on each side, with a threshold when the ratio between the sides is equal to 1/p. We follow the approach of Melanie Wood and consider random graphs as a special case of random matrices, and rely on a variant the definition of min-entropy given by Maples, in order to obtain useful results about these random matrices. Our results show that unlike the sandpile groups of Erdos-Renyi random graphs, the distribution of the sandp"},"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":"1705.07519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T22:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"c81b04b34f848428d50aef02a5052ec87fda49f20375efb175280fb9d4e9d7a2","abstract_canon_sha256":"62c23d2420a6a56c4903fe4ca70157882c818f865806e0bf32bbe185d3a0e4f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.319271Z","signature_b64":"/60nGCOSM2WauM4/4bW+Vd4zjyNwUyg+aMgQKJnCLH90Kf5GXGz05WSdfr3zNRKQnCq+0fanA0MVQvqimIPMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e44788b0c1b08aee67b514b22914f32a654ac90b4d48e3a7c56bfe28b7c2b9a","last_reissued_at":"2026-05-18T00:44:05.318823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.318823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sandpile Groups of Random Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shaked Koplewitz","submitted_at":"2017-05-21T22:45:52Z","abstract_excerpt":"We determine the asymptotic distribution of the p-rank of the sandpile groups of random bipartite graphs. We see that this depends on the ratio between the number of vertices on each side, with a threshold when the ratio between the sides is equal to 1/p. We follow the approach of Melanie Wood and consider random graphs as a special case of random matrices, and rely on a variant the definition of min-entropy given by Maples, in order to obtain useful results about these random matrices. Our results show that unlike the sandpile groups of Erdos-Renyi random graphs, the distribution of the sandp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07519","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":"1705.07519","created_at":"2026-05-18T00:44:05.318892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07519v1","created_at":"2026-05-18T00:44:05.318892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07519","created_at":"2026-05-18T00:44:05.318892+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZCHRCYMDMEK","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZCHRCYMDMEK5ZT3","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZCHRCYM","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04395","citing_title":"Chip-Firing Games and Critical Groups","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK","json":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK.json","graph_json":"https://pith.science/api/pith-number/LZCHRCYMDMEK5ZT3KFFSFEKPGK/graph.json","events_json":"https://pith.science/api/pith-number/LZCHRCYMDMEK5ZT3KFFSFEKPGK/events.json","paper":"https://pith.science/paper/LZCHRCYM"},"agent_actions":{"view_html":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK","download_json":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK.json","view_paper":"https://pith.science/paper/LZCHRCYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07519&json=true","fetch_graph":"https://pith.science/api/pith-number/LZCHRCYMDMEK5ZT3KFFSFEKPGK/graph.json","fetch_events":"https://pith.science/api/pith-number/LZCHRCYMDMEK5ZT3KFFSFEKPGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK/action/storage_attestation","attest_author":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK/action/author_attestation","sign_citation":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK/action/citation_signature","submit_replication":"https://pith.science/pith/LZCHRCYMDMEK5ZT3KFFSFEKPGK/action/replication_record"}},"created_at":"2026-05-18T00:44:05.318892+00:00","updated_at":"2026-05-18T00:44:05.318892+00:00"}