{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:3SRBMQZHU5PCGWW26JXTAGUJJJ","short_pith_number":"pith:3SRBMQZH","schema_version":"1.0","canonical_sha256":"dca2164327a75e235adaf26f301a894a4a68b3d724728a1d98574e447098a165","source":{"kind":"arxiv","id":"0710.0050","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Stokes formulas via minimal resolutions","license":"","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Bernhard Hanke, Carsten Schultz, G\\\"unter M. Ziegler, Raman Sanyal","submitted_at":"2007-09-29T12:36:34Z","abstract_excerpt":"We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a \"Z_k-combinatorial Stokes theorem\", which in turn implies \"Dold's theorem\" that there is no equivariant map from an n-connected to an n-dimensional free Z_k-complex.\n  Thus we build a combinatorial access road to problems in combinatorics and discrete geometry that have previously been treated with methods from equivariant topology. The special case k=2 for this is classical; it involves Tucker's (1949) combinato"},"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":"0710.0050","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-09-29T12:36:34Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"bd4a6a4ba9bcc43b5064a78a13938cb31d9296efdd879b91970108f9c676d7c7","abstract_canon_sha256":"295cf46796583b625106e9fa1cf03fcbf821818bd7063de29c07cf748e5a8dd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:53.696078Z","signature_b64":"hC7hAipjkCsacG4U4awQuih2SnhoK5BsketsangtnKXyfLLRh7Dfpo5jZOxmSTpbMKau+oNJX02c671jrsKLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca2164327a75e235adaf26f301a894a4a68b3d724728a1d98574e447098a165","last_reissued_at":"2026-05-18T03:37:53.695463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:53.695463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Stokes formulas via minimal resolutions","license":"","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Bernhard Hanke, Carsten Schultz, G\\\"unter M. Ziegler, Raman Sanyal","submitted_at":"2007-09-29T12:36:34Z","abstract_excerpt":"We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a \"Z_k-combinatorial Stokes theorem\", which in turn implies \"Dold's theorem\" that there is no equivariant map from an n-connected to an n-dimensional free Z_k-complex.\n  Thus we build a combinatorial access road to problems in combinatorics and discrete geometry that have previously been treated with methods from equivariant topology. The special case k=2 for this is classical; it involves Tucker's (1949) combinato"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.0050","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":"0710.0050","created_at":"2026-05-18T03:37:53.695560+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.0050v1","created_at":"2026-05-18T03:37:53.695560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.0050","created_at":"2026-05-18T03:37:53.695560+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SRBMQZHU5PC","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SRBMQZHU5PCGWW2","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SRBMQZH","created_at":"2026-05-18T12:25:54.717736+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/3SRBMQZHU5PCGWW26JXTAGUJJJ","json":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ.json","graph_json":"https://pith.science/api/pith-number/3SRBMQZHU5PCGWW26JXTAGUJJJ/graph.json","events_json":"https://pith.science/api/pith-number/3SRBMQZHU5PCGWW26JXTAGUJJJ/events.json","paper":"https://pith.science/paper/3SRBMQZH"},"agent_actions":{"view_html":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ","download_json":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ.json","view_paper":"https://pith.science/paper/3SRBMQZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.0050&json=true","fetch_graph":"https://pith.science/api/pith-number/3SRBMQZHU5PCGWW26JXTAGUJJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3SRBMQZHU5PCGWW26JXTAGUJJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ/action/storage_attestation","attest_author":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ/action/author_attestation","sign_citation":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ/action/citation_signature","submit_replication":"https://pith.science/pith/3SRBMQZHU5PCGWW26JXTAGUJJJ/action/replication_record"}},"created_at":"2026-05-18T03:37:53.695560+00:00","updated_at":"2026-05-18T03:37:53.695560+00:00"}