{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ARCVJ4Z3FSMZM7AUA42AGBGP6G","short_pith_number":"pith:ARCVJ4Z3","schema_version":"1.0","canonical_sha256":"044554f33b2c99967c1407340304cff1a97f3fbf7c90c91f0f2312e5858108be","source":{"kind":"arxiv","id":"1604.06931","version":2},"attestation_state":"computed","paper":{"title":"Counting faces of graphical zonotopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Gruji\\'c","submitted_at":"2016-04-23T18:11:32Z","abstract_excerpt":"It is a classical fact that the number of vertices of the graphical zonotope $Z_\\Gamma$ is equal to the number of acyclic orientations of a graph $\\Gamma$. We show that the $f$-polynomial of $Z_\\Gamma$ is obtained as the principal specialization of the $q$-analog of the chromatic symmetric function of $\\Gamma$."},"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":"1604.06931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-23T18:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"e093be0c19ad63606766fd6b67e7732c697ebbf20517ae9613e7cefd1557f8bf","abstract_canon_sha256":"cbb20d08bb6500cc3450bbca95bb6dbfd431974bb1dc305c61d220ddf7b86929"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.061421Z","signature_b64":"aPnPN31PLhEr/dqlEJRbpCqVmQ0vnKEfg2h6dbgnV40c97G3TwJu0oaqSvIPWo7CB7/0WSSV9g6fshYdssnNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044554f33b2c99967c1407340304cff1a97f3fbf7c90c91f0f2312e5858108be","last_reissued_at":"2026-05-18T00:47:59.060765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.060765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting faces of graphical zonotopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Gruji\\'c","submitted_at":"2016-04-23T18:11:32Z","abstract_excerpt":"It is a classical fact that the number of vertices of the graphical zonotope $Z_\\Gamma$ is equal to the number of acyclic orientations of a graph $\\Gamma$. We show that the $f$-polynomial of $Z_\\Gamma$ is obtained as the principal specialization of the $q$-analog of the chromatic symmetric function of $\\Gamma$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06931","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":"1604.06931","created_at":"2026-05-18T00:47:59.060864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06931v2","created_at":"2026-05-18T00:47:59.060864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06931","created_at":"2026-05-18T00:47:59.060864+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARCVJ4Z3FSMZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARCVJ4Z3FSMZM7AU","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARCVJ4Z3","created_at":"2026-05-18T12:30:07.202191+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/ARCVJ4Z3FSMZM7AUA42AGBGP6G","json":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G.json","graph_json":"https://pith.science/api/pith-number/ARCVJ4Z3FSMZM7AUA42AGBGP6G/graph.json","events_json":"https://pith.science/api/pith-number/ARCVJ4Z3FSMZM7AUA42AGBGP6G/events.json","paper":"https://pith.science/paper/ARCVJ4Z3"},"agent_actions":{"view_html":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G","download_json":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G.json","view_paper":"https://pith.science/paper/ARCVJ4Z3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06931&json=true","fetch_graph":"https://pith.science/api/pith-number/ARCVJ4Z3FSMZM7AUA42AGBGP6G/graph.json","fetch_events":"https://pith.science/api/pith-number/ARCVJ4Z3FSMZM7AUA42AGBGP6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G/action/storage_attestation","attest_author":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G/action/author_attestation","sign_citation":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G/action/citation_signature","submit_replication":"https://pith.science/pith/ARCVJ4Z3FSMZM7AUA42AGBGP6G/action/replication_record"}},"created_at":"2026-05-18T00:47:59.060864+00:00","updated_at":"2026-05-18T00:47:59.060864+00:00"}