{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:ONACLYGRWSULRLCNV2LX22YIW3","short_pith_number":"pith:ONACLYGR","canonical_record":{"source":{"id":"math/0208072","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2002-08-09T06:05:06Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"25ee4d2dc94b17697078c4352b20dfcb3978e92cb82fa137d8847ee654ff249c","abstract_canon_sha256":"9f533fb767da10882bae4c37d7ce392300211ee77cfcfa82d274f098b955ee5d"},"schema_version":"1.0"},"canonical_sha256":"734025e0d1b4a8b8ac4dae977d6b08b6f3f2ff814bfcf6bee1adf6e3ce10e4d3","source":{"kind":"arxiv","id":"math/0208072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0208072","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"math/0208072v3","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0208072","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"ONACLYGRWSUL","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"pith_short_16","alias_value":"ONACLYGRWSULRLCN","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"pith_short_8","alias_value":"ONACLYGR","created_at":"2026-07-04T14:36:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:ONACLYGRWSULRLCNV2LX22YIW3","target":"record","payload":{"canonical_record":{"source":{"id":"math/0208072","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2002-08-09T06:05:06Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"25ee4d2dc94b17697078c4352b20dfcb3978e92cb82fa137d8847ee654ff249c","abstract_canon_sha256":"9f533fb767da10882bae4c37d7ce392300211ee77cfcfa82d274f098b955ee5d"},"schema_version":"1.0"},"canonical_sha256":"734025e0d1b4a8b8ac4dae977d6b08b6f3f2ff814bfcf6bee1adf6e3ce10e4d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:36:22.267391Z","signature_b64":"XLTNVl74ZGpeKdEZVpmWzRJfwUmUWvvbl8thfDSX+rYlVDsr18u3aNTJN3HrScBmrqI75t2E2YKt+3lWkZbKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"734025e0d1b4a8b8ac4dae977d6b08b6f3f2ff814bfcf6bee1adf6e3ce10e4d3","last_reissued_at":"2026-07-04T14:36:22.266959Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:36:22.266959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0208072","source_version":3,"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-07-04T14:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPGaRi6fRGOfMbNYls+QWPuYo4c53FrxG1Ir1P/bUlatkFAJzcZjTNPphw4nLrd/ptS32rsv4HsrzYvramyJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:40:49.638333Z"},"content_sha256":"290fee6581b52c0383800804f77e6220421ede0b1b798d98966f87c33895840f","schema_version":"1.0","event_id":"sha256:290fee6581b52c0383800804f77e6220421ede0b1b798d98966f87c33895840f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:ONACLYGRWSULRLCNV2LX22YIW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological lower bounds for the chromatic number: A hierarchy","license":"","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"G\\\"unter M. Ziegler, Jiri Matousek","submitted_at":"2002-08-09T06:05:06Z","abstract_excerpt":"This paper is a study of ``topological'' lower bounds for the chromatic number of a graph. Such a lower bound was first introduced by Lov\\'asz in 1978, in his famous proof of the \\emph{Kneser conjecture} via Algebraic Topology. This conjecture stated that the \\emph{Kneser graph} $\\KG_{m,n}$, the graph with all $k$-element subsets of $\\{1,2,...,n\\}$ as vertices and all pairs of disjoint sets as edges, has chromatic number $n-2k+2$. Several other proofs have since been published (by B\\'ar\\'any, Schrijver, Dolnikov, Sarkaria, Kriz, Greene, and others), all of them based on some version of the Bor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0208072","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0208072/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeJkvyWPzX127VCO0WgT8fMexKSEstW3/cSnS1s3QT86lwKPtMtrZIF2ENzde0gKdFAWO09tF0cLvsit1iTfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:40:49.638728Z"},"content_sha256":"64a62e144b424dc4badbe281dde11c36668079500ebdbc7db4de22e7c9463b24","schema_version":"1.0","event_id":"sha256:64a62e144b424dc4badbe281dde11c36668079500ebdbc7db4de22e7c9463b24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONACLYGRWSULRLCNV2LX22YIW3/bundle.json","state_url":"https://pith.science/pith/ONACLYGRWSULRLCNV2LX22YIW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONACLYGRWSULRLCNV2LX22YIW3/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-07-07T15:40:49Z","links":{"resolver":"https://pith.science/pith/ONACLYGRWSULRLCNV2LX22YIW3","bundle":"https://pith.science/pith/ONACLYGRWSULRLCNV2LX22YIW3/bundle.json","state":"https://pith.science/pith/ONACLYGRWSULRLCNV2LX22YIW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONACLYGRWSULRLCNV2LX22YIW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:ONACLYGRWSULRLCNV2LX22YIW3","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":"9f533fb767da10882bae4c37d7ce392300211ee77cfcfa82d274f098b955ee5d","cross_cats_sorted":["math.AT"],"license":"","primary_cat":"math.CO","submitted_at":"2002-08-09T06:05:06Z","title_canon_sha256":"25ee4d2dc94b17697078c4352b20dfcb3978e92cb82fa137d8847ee654ff249c"},"schema_version":"1.0","source":{"id":"math/0208072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0208072","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"math/0208072v3","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0208072","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"ONACLYGRWSUL","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"pith_short_16","alias_value":"ONACLYGRWSULRLCN","created_at":"2026-07-04T14:36:22Z"},{"alias_kind":"pith_short_8","alias_value":"ONACLYGR","created_at":"2026-07-04T14:36:22Z"}],"graph_snapshots":[{"event_id":"sha256:64a62e144b424dc4badbe281dde11c36668079500ebdbc7db4de22e7c9463b24","target":"graph","created_at":"2026-07-04T14:36:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0208072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper is a study of ``topological'' lower bounds for the chromatic number of a graph. Such a lower bound was first introduced by Lov\\'asz in 1978, in his famous proof of the \\emph{Kneser conjecture} via Algebraic Topology. This conjecture stated that the \\emph{Kneser graph} $\\KG_{m,n}$, the graph with all $k$-element subsets of $\\{1,2,...,n\\}$ as vertices and all pairs of disjoint sets as edges, has chromatic number $n-2k+2$. Several other proofs have since been published (by B\\'ar\\'any, Schrijver, Dolnikov, Sarkaria, Kriz, Greene, and others), all of them based on some version of the Bor","authors_text":"G\\\"unter M. Ziegler, Jiri Matousek","cross_cats":["math.AT"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2002-08-09T06:05:06Z","title":"Topological lower bounds for the chromatic number: A hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0208072","kind":"arxiv","version":3},"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:290fee6581b52c0383800804f77e6220421ede0b1b798d98966f87c33895840f","target":"record","created_at":"2026-07-04T14:36:22Z","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":"9f533fb767da10882bae4c37d7ce392300211ee77cfcfa82d274f098b955ee5d","cross_cats_sorted":["math.AT"],"license":"","primary_cat":"math.CO","submitted_at":"2002-08-09T06:05:06Z","title_canon_sha256":"25ee4d2dc94b17697078c4352b20dfcb3978e92cb82fa137d8847ee654ff249c"},"schema_version":"1.0","source":{"id":"math/0208072","kind":"arxiv","version":3}},"canonical_sha256":"734025e0d1b4a8b8ac4dae977d6b08b6f3f2ff814bfcf6bee1adf6e3ce10e4d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"734025e0d1b4a8b8ac4dae977d6b08b6f3f2ff814bfcf6bee1adf6e3ce10e4d3","first_computed_at":"2026-07-04T14:36:22.266959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:36:22.266959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XLTNVl74ZGpeKdEZVpmWzRJfwUmUWvvbl8thfDSX+rYlVDsr18u3aNTJN3HrScBmrqI75t2E2YKt+3lWkZbKCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:36:22.267391Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0208072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:290fee6581b52c0383800804f77e6220421ede0b1b798d98966f87c33895840f","sha256:64a62e144b424dc4badbe281dde11c36668079500ebdbc7db4de22e7c9463b24"],"state_sha256":"e086285da5ae7cb46d8dcf3b6739bce1ae4ce58ffc0c289c72565c9b9aba188e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0TwUL4yn/OtQA6DilaTMZ+0OwablDAK0xlKSFE4h/ZGQRL4IyPL9rdjzoexqRIyRDGYZkVobUQZBQmvsNRFBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:40:49.641788Z","bundle_sha256":"c22747a732d161ac59faa631464f059550972f55e59db47cf12854f7d2145d4f"}}