{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L5JGCDG2GWVPOSLMVDKS37E5QB","short_pith_number":"pith:L5JGCDG2","schema_version":"1.0","canonical_sha256":"5f52610cda35aaf7496ca8d52dfc9d8069457563e7b9f2527f49a365fd6a649c","source":{"kind":"arxiv","id":"1309.2201","version":2},"attestation_state":"computed","paper":{"title":"G-parking functions and tree inversions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Perkinson, Kuai Yu, Qiaoyu Yang","submitted_at":"2013-09-09T15:58:55Z","abstract_excerpt":"A depth-first search version of Dhar's burning algorithm is used to give a bijection between the parking functions of a graph and labeled spanning trees, relating the degree of the parking function with the number of inversions of the spanning tree. Specializing to the complete graph answers a problem posed by R. Stanley."},"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":"1309.2201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-09T15:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"7a8fc56bf034c519eee30bcd60cab9ec922648fa3c349df112a0306e5c930451","abstract_canon_sha256":"a73ef8cdd6f5674ef96116dfe4fdb05328ea19611318e0da353c44e42aa7b6aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.533572Z","signature_b64":"Ys93oQJ6okTnVNmQfpYMaOltFnsxt1ScFCITjLsQ5TQBIzZMTBY9r83SNFj4oXdzza+FMI4haaJG+S2NuwCsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f52610cda35aaf7496ca8d52dfc9d8069457563e7b9f2527f49a365fd6a649c","last_reissued_at":"2026-05-18T02:30:32.532913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.532913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"G-parking functions and tree inversions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Perkinson, Kuai Yu, Qiaoyu Yang","submitted_at":"2013-09-09T15:58:55Z","abstract_excerpt":"A depth-first search version of Dhar's burning algorithm is used to give a bijection between the parking functions of a graph and labeled spanning trees, relating the degree of the parking function with the number of inversions of the spanning tree. Specializing to the complete graph answers a problem posed by R. Stanley."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2201","kind":"arxiv","version":2},"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":"1309.2201","created_at":"2026-05-18T02:30:32.533009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2201v2","created_at":"2026-05-18T02:30:32.533009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2201","created_at":"2026-05-18T02:30:32.533009+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5JGCDG2GWVP","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5JGCDG2GWVPOSLM","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5JGCDG2","created_at":"2026-05-18T12:27:51.066281+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/L5JGCDG2GWVPOSLMVDKS37E5QB","json":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB.json","graph_json":"https://pith.science/api/pith-number/L5JGCDG2GWVPOSLMVDKS37E5QB/graph.json","events_json":"https://pith.science/api/pith-number/L5JGCDG2GWVPOSLMVDKS37E5QB/events.json","paper":"https://pith.science/paper/L5JGCDG2"},"agent_actions":{"view_html":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB","download_json":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB.json","view_paper":"https://pith.science/paper/L5JGCDG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2201&json=true","fetch_graph":"https://pith.science/api/pith-number/L5JGCDG2GWVPOSLMVDKS37E5QB/graph.json","fetch_events":"https://pith.science/api/pith-number/L5JGCDG2GWVPOSLMVDKS37E5QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB/action/storage_attestation","attest_author":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB/action/author_attestation","sign_citation":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB/action/citation_signature","submit_replication":"https://pith.science/pith/L5JGCDG2GWVPOSLMVDKS37E5QB/action/replication_record"}},"created_at":"2026-05-18T02:30:32.533009+00:00","updated_at":"2026-05-18T02:30:32.533009+00:00"}