{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OQ2RYEIHY4D7HXMXWGJFXOKGZC","short_pith_number":"pith:OQ2RYEIH","schema_version":"1.0","canonical_sha256":"74351c1107c707f3dd97b1925bb946c89428fd1f6e4999c3458d92677d93070b","source":{"kind":"arxiv","id":"1412.2561","version":1},"attestation_state":"computed","paper":{"title":"On commutative algebra associated to $t$-labeled subforests of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Gleb Nenashev","submitted_at":"2014-12-08T13:55:14Z","abstract_excerpt":"For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$.\n  We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial meaning and that its Hilbert polynomial can be expressed through the Tutte polynomial of $G$."},"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":"1412.2561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T13:55:14Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"cecfb2036f63b5b7a56ea1968b01dbb646755ff5c1a72e651e70d4dfd74135e2","abstract_canon_sha256":"4baae86c73974114d19a1ce3b08e64549eaea2a9be6baf866b2974f4e8b91fc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:57.591481Z","signature_b64":"H+4+K1ROmzcqZ6n+7trwBdNjPQCeH71gInWjJ73Dyrz20nTP31tZ+uDrB3EsW7dTk1N+dVx0wExNwgiRcURUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74351c1107c707f3dd97b1925bb946c89428fd1f6e4999c3458d92677d93070b","last_reissued_at":"2026-05-18T02:31:57.590689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:57.590689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On commutative algebra associated to $t$-labeled subforests of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Gleb Nenashev","submitted_at":"2014-12-08T13:55:14Z","abstract_excerpt":"For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$.\n  We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial meaning and that its Hilbert polynomial can be expressed through the Tutte polynomial of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2561","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":"1412.2561","created_at":"2026-05-18T02:31:57.590824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2561v1","created_at":"2026-05-18T02:31:57.590824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2561","created_at":"2026-05-18T02:31:57.590824+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQ2RYEIHY4D7","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQ2RYEIHY4D7HXMX","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQ2RYEIH","created_at":"2026-05-18T12:28:41.024544+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/OQ2RYEIHY4D7HXMXWGJFXOKGZC","json":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC.json","graph_json":"https://pith.science/api/pith-number/OQ2RYEIHY4D7HXMXWGJFXOKGZC/graph.json","events_json":"https://pith.science/api/pith-number/OQ2RYEIHY4D7HXMXWGJFXOKGZC/events.json","paper":"https://pith.science/paper/OQ2RYEIH"},"agent_actions":{"view_html":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC","download_json":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC.json","view_paper":"https://pith.science/paper/OQ2RYEIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2561&json=true","fetch_graph":"https://pith.science/api/pith-number/OQ2RYEIHY4D7HXMXWGJFXOKGZC/graph.json","fetch_events":"https://pith.science/api/pith-number/OQ2RYEIHY4D7HXMXWGJFXOKGZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC/action/storage_attestation","attest_author":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC/action/author_attestation","sign_citation":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC/action/citation_signature","submit_replication":"https://pith.science/pith/OQ2RYEIHY4D7HXMXWGJFXOKGZC/action/replication_record"}},"created_at":"2026-05-18T02:31:57.590824+00:00","updated_at":"2026-05-18T02:31:57.590824+00:00"}