{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FJRR7CV3EIMAETPFT5O3ZDKILT","short_pith_number":"pith:FJRR7CV3","canonical_record":{"source":{"id":"1612.09487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-30T13:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"e18f171225b6cf0805f0c4a2d79fe5a74cd63391d0fd0e7c89d0f99dd6249ae2","abstract_canon_sha256":"0cb7c3872ac95b131ba7cfb20f0ba9beda5380fd4c49805ef5ad418d8cc7650b"},"schema_version":"1.0"},"canonical_sha256":"2a631f8abb2218024de59f5dbc8d485cfaa424253cf3d6bd9332621b6e2db6c8","source":{"kind":"arxiv","id":"1612.09487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09487","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09487v2","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09487","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"FJRR7CV3EIMA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJRR7CV3EIMAETPF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJRR7CV3","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FJRR7CV3EIMAETPFT5O3ZDKILT","target":"record","payload":{"canonical_record":{"source":{"id":"1612.09487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-30T13:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"e18f171225b6cf0805f0c4a2d79fe5a74cd63391d0fd0e7c89d0f99dd6249ae2","abstract_canon_sha256":"0cb7c3872ac95b131ba7cfb20f0ba9beda5380fd4c49805ef5ad418d8cc7650b"},"schema_version":"1.0"},"canonical_sha256":"2a631f8abb2218024de59f5dbc8d485cfaa424253cf3d6bd9332621b6e2db6c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:31.247767Z","signature_b64":"7/WC0PPiHQcN3evcdRUAx6hhl9vJQn3SfcGea0njnb9hzoahwM8Z9Oz9xcOl0b0100XxW+41GFCnzqz/j4NeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a631f8abb2218024de59f5dbc8d485cfaa424253cf3d6bd9332621b6e2db6c8","last_reissued_at":"2026-05-17T23:46:31.247123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:31.247123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.09487","source_version":2,"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-17T23:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkFe0u4ymAqG16tuCmZEbxxLIshJDVUf+eQgYPeMA0C8AZVLSKPnhoY0dOfMidk7VjTdwf9BEMkTx7IyJPSuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:33:37.689098Z"},"content_sha256":"8f03f567562690fe7c9ba9496980d014ed14ce748c8a4bfb6140a239efb17a97","schema_version":"1.0","event_id":"sha256:8f03f567562690fe7c9ba9496980d014ed14ce748c8a4bfb6140a239efb17a97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FJRR7CV3EIMAETPFT5O3ZDKILT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorics of `unavoidable complexes'","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Du\\v{s}ko Joji\\'c, Marija Jeli\\'c Milutinovi\\'c, Marinko Timotijevi\\'c, Rade T. \\v{Z}ivaljevi\\'c, Sini\\v{s}a T. Vre\\'cica","submitted_at":"2016-12-30T13:33:17Z","abstract_excerpt":"The partition number $\\pi(K)$ of a simplicial complex $K\\subset 2^{[n]}$ is the minimum integer $\\nu$ such that for each partition $A_1\\uplus\\ldots\\uplus A_\\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is $r$-unavoidable if $\\pi(K)\\leq r$. Motivated by the problems of Tverberg-Van Kampen-Flores type, and inspired by the `constraint method' of Blagojevi\\'{c}, Frick, and Ziegler, arXiv:1401.0690 [math.CO], we study the combinatorics of $r$-unavoidable complexes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09487","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"},"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-17T23:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SH80FOVraCZdgmIQz9ho+yFSXJn6TrxTuzZxUkrooMDNHEk7YxV2LJAXqBJSM7y4bWDL99qD1QGc+0j01MfJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:33:37.689748Z"},"content_sha256":"4f771e3edc5f64bc69ae47637597d6d4d6ec8b1613a4ceb99b1d0e515892f678","schema_version":"1.0","event_id":"sha256:4f771e3edc5f64bc69ae47637597d6d4d6ec8b1613a4ceb99b1d0e515892f678"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJRR7CV3EIMAETPFT5O3ZDKILT/bundle.json","state_url":"https://pith.science/pith/FJRR7CV3EIMAETPFT5O3ZDKILT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJRR7CV3EIMAETPFT5O3ZDKILT/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-06-07T07:33:37Z","links":{"resolver":"https://pith.science/pith/FJRR7CV3EIMAETPFT5O3ZDKILT","bundle":"https://pith.science/pith/FJRR7CV3EIMAETPFT5O3ZDKILT/bundle.json","state":"https://pith.science/pith/FJRR7CV3EIMAETPFT5O3ZDKILT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJRR7CV3EIMAETPFT5O3ZDKILT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FJRR7CV3EIMAETPFT5O3ZDKILT","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":"0cb7c3872ac95b131ba7cfb20f0ba9beda5380fd4c49805ef5ad418d8cc7650b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-30T13:33:17Z","title_canon_sha256":"e18f171225b6cf0805f0c4a2d79fe5a74cd63391d0fd0e7c89d0f99dd6249ae2"},"schema_version":"1.0","source":{"id":"1612.09487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09487","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09487v2","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09487","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"FJRR7CV3EIMA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJRR7CV3EIMAETPF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJRR7CV3","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:4f771e3edc5f64bc69ae47637597d6d4d6ec8b1613a4ceb99b1d0e515892f678","target":"graph","created_at":"2026-05-17T23:46:31Z","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 partition number $\\pi(K)$ of a simplicial complex $K\\subset 2^{[n]}$ is the minimum integer $\\nu$ such that for each partition $A_1\\uplus\\ldots\\uplus A_\\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is $r$-unavoidable if $\\pi(K)\\leq r$. Motivated by the problems of Tverberg-Van Kampen-Flores type, and inspired by the `constraint method' of Blagojevi\\'{c}, Frick, and Ziegler, arXiv:1401.0690 [math.CO], we study the combinatorics of $r$-unavoidable complexes.","authors_text":"Du\\v{s}ko Joji\\'c, Marija Jeli\\'c Milutinovi\\'c, Marinko Timotijevi\\'c, Rade T. \\v{Z}ivaljevi\\'c, Sini\\v{s}a T. Vre\\'cica","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-30T13:33:17Z","title":"Combinatorics of `unavoidable complexes'"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09487","kind":"arxiv","version":2},"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:8f03f567562690fe7c9ba9496980d014ed14ce748c8a4bfb6140a239efb17a97","target":"record","created_at":"2026-05-17T23:46:31Z","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":"0cb7c3872ac95b131ba7cfb20f0ba9beda5380fd4c49805ef5ad418d8cc7650b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-30T13:33:17Z","title_canon_sha256":"e18f171225b6cf0805f0c4a2d79fe5a74cd63391d0fd0e7c89d0f99dd6249ae2"},"schema_version":"1.0","source":{"id":"1612.09487","kind":"arxiv","version":2}},"canonical_sha256":"2a631f8abb2218024de59f5dbc8d485cfaa424253cf3d6bd9332621b6e2db6c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a631f8abb2218024de59f5dbc8d485cfaa424253cf3d6bd9332621b6e2db6c8","first_computed_at":"2026-05-17T23:46:31.247123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:31.247123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7/WC0PPiHQcN3evcdRUAx6hhl9vJQn3SfcGea0njnb9hzoahwM8Z9Oz9xcOl0b0100XxW+41GFCnzqz/j4NeAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:31.247767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.09487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f03f567562690fe7c9ba9496980d014ed14ce748c8a4bfb6140a239efb17a97","sha256:4f771e3edc5f64bc69ae47637597d6d4d6ec8b1613a4ceb99b1d0e515892f678"],"state_sha256":"00d5196b2160ea860c17d7342d96ea19fbe0fe7739785859da14376f6c4c3778"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6N8lvOzt8bBnpKHRAdKDJGuPZeoSK+JauaG7hwz5++lKb+GlMdBTimBWSxaB6hg33QXz1zgPKuk3ALwN20RBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:33:37.692644Z","bundle_sha256":"bf92df4c494ca83fd9498d28858398d6902898e003d21dcd8b55352e41028598"}}