{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RHOLKBTX2ZTFDK7F6R5WXJPBQR","short_pith_number":"pith:RHOLKBTX","schema_version":"1.0","canonical_sha256":"89dcb50677d66651abe5f47b6ba5e1846180a25ed52c560758ed149305effeca","source":{"kind":"arxiv","id":"1105.1455","version":4},"attestation_state":"computed","paper":{"title":"Tverberg's theorem and graph coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.GT"],"primary_cat":"math.CO","authors_text":"Alexander Engstr\\\"om, Patrik Nor\\'en","submitted_at":"2011-05-07T16:11:09Z","abstract_excerpt":"The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions.\n  Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are encoded with graphs. When two points are adjacent in the graph, they are not in the same part. If the restrictions are too harsh, then the topological Tverberg theorem fails. The colored Tverberg theorem corresponds to graphs constructed as disjoint unions of small complete graphs. Hell studied the case of paths and cycles.\n  In graph theory these partitions"},"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":"1105.1455","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-07T16:11:09Z","cross_cats_sorted":["math.AT","math.GT"],"title_canon_sha256":"817294e143715666f3763ed4686dc1a511e622e57914b27ab6b439ecbf249794","abstract_canon_sha256":"860c787e62df824053d83785e9b766810fb2ca4b61b4bd47fd19240dacd34115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:04.576571Z","signature_b64":"wi65v57tQcXiGIkDvCJSKUOwi+9byRt9UwX+qdlblC3/A3YEpB4RBxrXfIoDbJnq5Fcy6YifS10EUs/fVm5xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89dcb50677d66651abe5f47b6ba5e1846180a25ed52c560758ed149305effeca","last_reissued_at":"2026-05-18T03:08:04.575800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:04.575800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tverberg's theorem and graph coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.GT"],"primary_cat":"math.CO","authors_text":"Alexander Engstr\\\"om, Patrik Nor\\'en","submitted_at":"2011-05-07T16:11:09Z","abstract_excerpt":"The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions.\n  Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are encoded with graphs. When two points are adjacent in the graph, they are not in the same part. If the restrictions are too harsh, then the topological Tverberg theorem fails. The colored Tverberg theorem corresponds to graphs constructed as disjoint unions of small complete graphs. Hell studied the case of paths and cycles.\n  In graph theory these partitions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1455","kind":"arxiv","version":4},"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":"1105.1455","created_at":"2026-05-18T03:08:04.575934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1455v4","created_at":"2026-05-18T03:08:04.575934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1455","created_at":"2026-05-18T03:08:04.575934+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHOLKBTX2ZTF","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHOLKBTX2ZTFDK7F","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHOLKBTX","created_at":"2026-05-18T12:26:41.206345+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/RHOLKBTX2ZTFDK7F6R5WXJPBQR","json":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR.json","graph_json":"https://pith.science/api/pith-number/RHOLKBTX2ZTFDK7F6R5WXJPBQR/graph.json","events_json":"https://pith.science/api/pith-number/RHOLKBTX2ZTFDK7F6R5WXJPBQR/events.json","paper":"https://pith.science/paper/RHOLKBTX"},"agent_actions":{"view_html":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR","download_json":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR.json","view_paper":"https://pith.science/paper/RHOLKBTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1455&json=true","fetch_graph":"https://pith.science/api/pith-number/RHOLKBTX2ZTFDK7F6R5WXJPBQR/graph.json","fetch_events":"https://pith.science/api/pith-number/RHOLKBTX2ZTFDK7F6R5WXJPBQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR/action/storage_attestation","attest_author":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR/action/author_attestation","sign_citation":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR/action/citation_signature","submit_replication":"https://pith.science/pith/RHOLKBTX2ZTFDK7F6R5WXJPBQR/action/replication_record"}},"created_at":"2026-05-18T03:08:04.575934+00:00","updated_at":"2026-05-18T03:08:04.575934+00:00"}