{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DMQXPONRF4TWH3ULOL626XRE4M","short_pith_number":"pith:DMQXPONR","canonical_record":{"source":{"id":"1407.1983","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-08T08:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"d47adcfc680de6da366d0bc65099a6ac6f027a9b52d38c02e69d025cf1c50d61","abstract_canon_sha256":"f2bc4f1cd1180d790351d3bec66bf763181d30d716a1843cd7e9f3370f69b83a"},"schema_version":"1.0"},"canonical_sha256":"1b2177b9b12f2763ee8b72fdaf5e24e30033a8d7583cbd6474d4dce8e66aff99","source":{"kind":"arxiv","id":"1407.1983","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1983","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1983v6","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1983","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"DMQXPONRF4TW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMQXPONRF4TWH3UL","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMQXPONR","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DMQXPONRF4TWH3ULOL626XRE4M","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1983","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-08T08:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"d47adcfc680de6da366d0bc65099a6ac6f027a9b52d38c02e69d025cf1c50d61","abstract_canon_sha256":"f2bc4f1cd1180d790351d3bec66bf763181d30d716a1843cd7e9f3370f69b83a"},"schema_version":"1.0"},"canonical_sha256":"1b2177b9b12f2763ee8b72fdaf5e24e30033a8d7583cbd6474d4dce8e66aff99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:06.022835Z","signature_b64":"1tseCCCTZcd3YzFfdp1fGle7inss1QsLBuHUw4sT4dDSJvSsYvN767ENc0Yp3cL5igr7lQn4TFdQeNwA4zuhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b2177b9b12f2763ee8b72fdaf5e24e30033a8d7583cbd6474d4dce8e66aff99","last_reissued_at":"2026-05-18T00:09:06.022276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:06.022276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1983","source_version":6,"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-18T00:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auMPLcYASvoyWcojeUG1GemT5pV+S0cWWtK0HEN8k+G+oEn85oThIB3VK4k9cdZISFm87vpBwsnNlCM8qzuuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:42:06.650095Z"},"content_sha256":"72c914d9c2081944ac885052be6514407abb1fee9d8bce8531bf2191e3fca6bc","schema_version":"1.0","event_id":"sha256:72c914d9c2081944ac885052be6514407abb1fee9d8bce8531bf2191e3fca6bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DMQXPONRF4TWH3ULOL626XRE4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From G-parking functions to B-parking functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong","submitted_at":"2014-07-08T08:04:08Z","abstract_excerpt":"A matching $M$ in a multigraph $G=(V,E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V(M)$ (i.e., the set of vertices saturated by $M$). For any fixed vertex $x_0$ in $G$, there is a bijection from the set of spanning trees of $G$ to the set of uniquely restricted matchings of size $|V|-1$ in $S(G)-x_0$, where $S(G)$ is the bipartite graph obtained from $G$ by subdividing each edge in $G$. Thus the notion \"uniquely restricted matchings of a bipartite graph $H$ saturating all vertices in a partite set $X$\" can be viewed as an extensio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1983","kind":"arxiv","version":6},"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-18T00:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmWHzuY+KkL1EQO9L+rO/fTmo/ZjoNqzFdbYzVmvTjKbt8dvj22i48Las/3k4F4BtOGfUmNU5sj1EyHB/702CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:42:06.650850Z"},"content_sha256":"80a29527e8031237d1a5150a3131fe78aa2e4a76d23d37860b9a8247d6ffa89b","schema_version":"1.0","event_id":"sha256:80a29527e8031237d1a5150a3131fe78aa2e4a76d23d37860b9a8247d6ffa89b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMQXPONRF4TWH3ULOL626XRE4M/bundle.json","state_url":"https://pith.science/pith/DMQXPONRF4TWH3ULOL626XRE4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMQXPONRF4TWH3ULOL626XRE4M/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-31T05:42:06Z","links":{"resolver":"https://pith.science/pith/DMQXPONRF4TWH3ULOL626XRE4M","bundle":"https://pith.science/pith/DMQXPONRF4TWH3ULOL626XRE4M/bundle.json","state":"https://pith.science/pith/DMQXPONRF4TWH3ULOL626XRE4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMQXPONRF4TWH3ULOL626XRE4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DMQXPONRF4TWH3ULOL626XRE4M","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":"f2bc4f1cd1180d790351d3bec66bf763181d30d716a1843cd7e9f3370f69b83a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-08T08:04:08Z","title_canon_sha256":"d47adcfc680de6da366d0bc65099a6ac6f027a9b52d38c02e69d025cf1c50d61"},"schema_version":"1.0","source":{"id":"1407.1983","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1983","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1983v6","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1983","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"DMQXPONRF4TW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMQXPONRF4TWH3UL","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMQXPONR","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:80a29527e8031237d1a5150a3131fe78aa2e4a76d23d37860b9a8247d6ffa89b","target":"graph","created_at":"2026-05-18T00:09:06Z","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":"A matching $M$ in a multigraph $G=(V,E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V(M)$ (i.e., the set of vertices saturated by $M$). For any fixed vertex $x_0$ in $G$, there is a bijection from the set of spanning trees of $G$ to the set of uniquely restricted matchings of size $|V|-1$ in $S(G)-x_0$, where $S(G)$ is the bipartite graph obtained from $G$ by subdividing each edge in $G$. Thus the notion \"uniquely restricted matchings of a bipartite graph $H$ saturating all vertices in a partite set $X$\" can be viewed as an extensio","authors_text":"Fengming Dong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-08T08:04:08Z","title":"From G-parking functions to B-parking functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1983","kind":"arxiv","version":6},"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:72c914d9c2081944ac885052be6514407abb1fee9d8bce8531bf2191e3fca6bc","target":"record","created_at":"2026-05-18T00:09:06Z","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":"f2bc4f1cd1180d790351d3bec66bf763181d30d716a1843cd7e9f3370f69b83a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-08T08:04:08Z","title_canon_sha256":"d47adcfc680de6da366d0bc65099a6ac6f027a9b52d38c02e69d025cf1c50d61"},"schema_version":"1.0","source":{"id":"1407.1983","kind":"arxiv","version":6}},"canonical_sha256":"1b2177b9b12f2763ee8b72fdaf5e24e30033a8d7583cbd6474d4dce8e66aff99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b2177b9b12f2763ee8b72fdaf5e24e30033a8d7583cbd6474d4dce8e66aff99","first_computed_at":"2026-05-18T00:09:06.022276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:06.022276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tseCCCTZcd3YzFfdp1fGle7inss1QsLBuHUw4sT4dDSJvSsYvN767ENc0Yp3cL5igr7lQn4TFdQeNwA4zuhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:06.022835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1983","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72c914d9c2081944ac885052be6514407abb1fee9d8bce8531bf2191e3fca6bc","sha256:80a29527e8031237d1a5150a3131fe78aa2e4a76d23d37860b9a8247d6ffa89b"],"state_sha256":"206a37bf84bff49a8d146dbedc38a8fce87b8c934e014d2a3fa69bf8fa05f995"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPnfx9gfl2/U4Dd1HnzG4SZv+rDDRgplJ0ogmkLK8xFQJiDm7v6qTvECqZxkIjFkHXib6Tu1XggYWt2R9HIdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:42:06.654828Z","bundle_sha256":"09719cb89be6c9e5871a4095f3596e79c9164f9270a6704af3d75e2d4acff547"}}