{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WREEN4VAUARJV6V26IOYSCBZAX","short_pith_number":"pith:WREEN4VA","schema_version":"1.0","canonical_sha256":"b44846f2a0a0229afabaf21d89083905e91a0db6411c58ba728caf732987fb64","source":{"kind":"arxiv","id":"1210.7569","version":3},"attestation_state":"computed","paper":{"title":"Minimal Free Resolutions of the $G$-parking Function Ideal and the Toppling Ideal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Frank-Olaf Schreyer, John Wilmes, Madhusudan Manjunath","submitted_at":"2012-10-29T05:44:03Z","abstract_excerpt":"The $G$-parking function ideal $M_G$ of a directed multigraph $G$ is a monomial ideal which encodes some of the combinatorial information of $G$. It is an initial ideal of the toppling ideal $I_G$, a lattice ideal intimately related to the chip-firing game on a graph. Both ideals were first studied by Cori, Rossin, and Salvy. A minimal free resolution for $M_G$ was given by Postnikov and Shaprio in the case when $G$ is saturated, i.\\,e., whenever there is at least one edge $(u,v)$ for every ordered pair of distinct vertices $u$ and $v$. They also raised the problem of an explicit description o"},"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":"1210.7569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-10-29T05:44:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"88a9df1fa01a8d267b8fc522cc00aacb68da39f39a45ab6bda10efaaf88cbf62","abstract_canon_sha256":"46f6a3351340c91edbff93272190a9be06151306a1449fe8da01547263134728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:52.330960Z","signature_b64":"wG6gAHptZGMROJY/NXdTNV3Fux8IlR4G8EYjurfE9wS69HAkJCgBd1ik1e/1NZRiELKfm3MUGauZ+NxUqS7MCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44846f2a0a0229afabaf21d89083905e91a0db6411c58ba728caf732987fb64","last_reissued_at":"2026-05-18T03:37:52.330300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:52.330300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Free Resolutions of the $G$-parking Function Ideal and the Toppling Ideal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Frank-Olaf Schreyer, John Wilmes, Madhusudan Manjunath","submitted_at":"2012-10-29T05:44:03Z","abstract_excerpt":"The $G$-parking function ideal $M_G$ of a directed multigraph $G$ is a monomial ideal which encodes some of the combinatorial information of $G$. It is an initial ideal of the toppling ideal $I_G$, a lattice ideal intimately related to the chip-firing game on a graph. Both ideals were first studied by Cori, Rossin, and Salvy. A minimal free resolution for $M_G$ was given by Postnikov and Shaprio in the case when $G$ is saturated, i.\\,e., whenever there is at least one edge $(u,v)$ for every ordered pair of distinct vertices $u$ and $v$. They also raised the problem of an explicit description o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7569","kind":"arxiv","version":3},"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":"1210.7569","created_at":"2026-05-18T03:37:52.330443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7569v3","created_at":"2026-05-18T03:37:52.330443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7569","created_at":"2026-05-18T03:37:52.330443+00:00"},{"alias_kind":"pith_short_12","alias_value":"WREEN4VAUARJ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WREEN4VAUARJV6V2","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WREEN4VA","created_at":"2026-05-18T12:27:25.539911+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/WREEN4VAUARJV6V26IOYSCBZAX","json":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX.json","graph_json":"https://pith.science/api/pith-number/WREEN4VAUARJV6V26IOYSCBZAX/graph.json","events_json":"https://pith.science/api/pith-number/WREEN4VAUARJV6V26IOYSCBZAX/events.json","paper":"https://pith.science/paper/WREEN4VA"},"agent_actions":{"view_html":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX","download_json":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX.json","view_paper":"https://pith.science/paper/WREEN4VA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7569&json=true","fetch_graph":"https://pith.science/api/pith-number/WREEN4VAUARJV6V26IOYSCBZAX/graph.json","fetch_events":"https://pith.science/api/pith-number/WREEN4VAUARJV6V26IOYSCBZAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX/action/storage_attestation","attest_author":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX/action/author_attestation","sign_citation":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX/action/citation_signature","submit_replication":"https://pith.science/pith/WREEN4VAUARJV6V26IOYSCBZAX/action/replication_record"}},"created_at":"2026-05-18T03:37:52.330443+00:00","updated_at":"2026-05-18T03:37:52.330443+00:00"}