{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PZEMO56GDBZ7RB7JLK4QMMSCQQ","short_pith_number":"pith:PZEMO56G","canonical_record":{"source":{"id":"1210.7621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T11:08:32Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"1c4247af5617a99a2a10c20bbbac802d7fe91cb08a0e927d8c0d189d7fc71f08","abstract_canon_sha256":"a75009bf060f4b78ead661568e0e7a059ae60d4ad0323ef8cfa38b25ee690bb1"},"schema_version":"1.0"},"canonical_sha256":"7e48c777c61873f887e95ab9063242841272e0d94160ebb398003da074207140","source":{"kind":"arxiv","id":"1210.7621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7621","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7621v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7621","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"PZEMO56GDBZ7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PZEMO56GDBZ7RB7J","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PZEMO56G","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PZEMO56GDBZ7RB7JLK4QMMSCQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T11:08:32Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"1c4247af5617a99a2a10c20bbbac802d7fe91cb08a0e927d8c0d189d7fc71f08","abstract_canon_sha256":"a75009bf060f4b78ead661568e0e7a059ae60d4ad0323ef8cfa38b25ee690bb1"},"schema_version":"1.0"},"canonical_sha256":"7e48c777c61873f887e95ab9063242841272e0d94160ebb398003da074207140","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.313854Z","signature_b64":"11KgSspkiO0gRxL1AHIhpyAG2xizjnn4JGBKF/sIGtMGYXFsE5qgOsMsKP0ElqLqrYI2NgqurSZGy7SEqH5dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e48c777c61873f887e95ab9063242841272e0d94160ebb398003da074207140","last_reissued_at":"2026-05-18T03:42:09.312794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.312794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7621","source_version":1,"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-05-18T03:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHGhiBZ/hK8J+z1FHJ4nS3YES81K/WmRNBhi7tSUJZKW8PHJYm+B1/Sw/9erSctpRWLphZgr14pA41wGLy14BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:12:23.338783Z"},"content_sha256":"599cc08d94e1dc91176e329f16555979af207404777d416708898696fd485175","schema_version":"1.0","event_id":"sha256:599cc08d94e1dc91176e329f16555979af207404777d416708898696fd485175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PZEMO56GDBZ7RB7JLK4QMMSCQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Lower Bounds for Colourful Simplicial Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Antoine Deza, Feng Xie, Tamon Stephen","submitted_at":"2012-10-29T11:08:32Z","abstract_excerpt":"The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful simplices generated by taking one point from each set. A construction attaining d^2+1 simplices is known, and is conjectured to be minimal. This has been confirmed up to d=3, however the best known lower bound for d at least 4 is ((d+1)^2)/2.\n  A promising method to improve this lower bound is to look at combinatorial octahedral systems generated by such configurati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7621","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"},"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-05-18T03:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIRUCfWRkigJJBLBMn4kqGwWYNqZ53iMacF+oVf4Y9sl6iyfa63twxUcYKRMRDWQYAgtwbbVpfQ3XPtlPf6oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:12:23.339477Z"},"content_sha256":"af3de3fff234a20f8661098cf209ca138f77a0dd3436f969dcc0b47e9e0b28ea","schema_version":"1.0","event_id":"sha256:af3de3fff234a20f8661098cf209ca138f77a0dd3436f969dcc0b47e9e0b28ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ/bundle.json","state_url":"https://pith.science/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ/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-05-25T23:12:23Z","links":{"resolver":"https://pith.science/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ","bundle":"https://pith.science/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ/bundle.json","state":"https://pith.science/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZEMO56GDBZ7RB7JLK4QMMSCQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PZEMO56GDBZ7RB7JLK4QMMSCQQ","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":"a75009bf060f4b78ead661568e0e7a059ae60d4ad0323ef8cfa38b25ee690bb1","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T11:08:32Z","title_canon_sha256":"1c4247af5617a99a2a10c20bbbac802d7fe91cb08a0e927d8c0d189d7fc71f08"},"schema_version":"1.0","source":{"id":"1210.7621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7621","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7621v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7621","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"PZEMO56GDBZ7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PZEMO56GDBZ7RB7J","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PZEMO56G","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:af3de3fff234a20f8661098cf209ca138f77a0dd3436f969dcc0b47e9e0b28ea","target":"graph","created_at":"2026-05-18T03:42:09Z","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"},"paper":{"abstract_excerpt":"The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful simplices generated by taking one point from each set. A construction attaining d^2+1 simplices is known, and is conjectured to be minimal. This has been confirmed up to d=3, however the best known lower bound for d at least 4 is ((d+1)^2)/2.\n  A promising method to improve this lower bound is to look at combinatorial octahedral systems generated by such configurati","authors_text":"Antoine Deza, Feng Xie, Tamon Stephen","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T11:08:32Z","title":"Computational Lower Bounds for Colourful Simplicial Depth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7621","kind":"arxiv","version":1},"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:599cc08d94e1dc91176e329f16555979af207404777d416708898696fd485175","target":"record","created_at":"2026-05-18T03:42:09Z","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":"a75009bf060f4b78ead661568e0e7a059ae60d4ad0323ef8cfa38b25ee690bb1","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T11:08:32Z","title_canon_sha256":"1c4247af5617a99a2a10c20bbbac802d7fe91cb08a0e927d8c0d189d7fc71f08"},"schema_version":"1.0","source":{"id":"1210.7621","kind":"arxiv","version":1}},"canonical_sha256":"7e48c777c61873f887e95ab9063242841272e0d94160ebb398003da074207140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e48c777c61873f887e95ab9063242841272e0d94160ebb398003da074207140","first_computed_at":"2026-05-18T03:42:09.312794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:09.312794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11KgSspkiO0gRxL1AHIhpyAG2xizjnn4JGBKF/sIGtMGYXFsE5qgOsMsKP0ElqLqrYI2NgqurSZGy7SEqH5dDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:09.313854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:599cc08d94e1dc91176e329f16555979af207404777d416708898696fd485175","sha256:af3de3fff234a20f8661098cf209ca138f77a0dd3436f969dcc0b47e9e0b28ea"],"state_sha256":"923586651a3b376ed990bcab6fd7db603869f0d003bf445466f27d9909733cf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"665OjdzIdt2Lg0IsqMdNEwe5i/egcaREp2Aqywyi4e5n6PJq0gZxI+kx3nRS3KQw2pJCBSAq9d/IZSAZ6FSeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:12:23.342501Z","bundle_sha256":"592075a1e296e73c906642d4a958a34911bb042593e414679727f11216ccc6a1"}}