{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JNWSNCQT2EPS4XJ7ZZKHQFKCX3","short_pith_number":"pith:JNWSNCQT","canonical_record":{"source":{"id":"1308.4321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T14:38:17Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"deab98e9b3aa8c065d0d62ff3912ece9835d717ac59428855a8b27164e61f8bd","abstract_canon_sha256":"70a963d214c2083e563a564e6b57451a438aae9d779a97e0f242476b17e8716d"},"schema_version":"1.0"},"canonical_sha256":"4b6d268a13d11f2e5d3fce54781542beee0a264748c01dd7368c5655c463f615","source":{"kind":"arxiv","id":"1308.4321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4321","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4321v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4321","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"JNWSNCQT2EPS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNWSNCQT2EPS4XJ7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNWSNCQT","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JNWSNCQT2EPS4XJ7ZZKHQFKCX3","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T14:38:17Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"deab98e9b3aa8c065d0d62ff3912ece9835d717ac59428855a8b27164e61f8bd","abstract_canon_sha256":"70a963d214c2083e563a564e6b57451a438aae9d779a97e0f242476b17e8716d"},"schema_version":"1.0"},"canonical_sha256":"4b6d268a13d11f2e5d3fce54781542beee0a264748c01dd7368c5655c463f615","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.157246Z","signature_b64":"PXB699rN7suyyQiX4LUl1gEANitAy7EQyEdzXv/KzQpCb+SoAdwhGDViOjWuJ9FC3h8MPzpP1BV8xeGAh5hGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6d268a13d11f2e5d3fce54781542beee0a264748c01dd7368c5655c463f615","last_reissued_at":"2026-05-18T03:15:33.156777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.156777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4321","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:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbahidpW3uSbCeODRWrVpu9eG8+MbmWcGRzBGQ1CY/sFmA14c5RzZktUuoziiUVCxnJRU3qJNeOSF9U1KrFLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:04:42.609928Z"},"content_sha256":"b4c179797fa8d5ad79e4c8ac11fda5aec037864d34a8bc6f25cedf8ad3e4c715","schema_version":"1.0","event_id":"sha256:b4c179797fa8d5ad79e4c8ac11fda5aec037864d34a8bc6f25cedf8ad3e4c715"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JNWSNCQT2EPS4XJ7ZZKHQFKCX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Obstacle Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Pat Morin, Vida Dujmovi\\'c","submitted_at":"2013-08-20T14:38:17Z","abstract_excerpt":"The obstacle number is a new graph parameter introduced by Alpert, Koch, and Laison (2010). Mukkamala etal (2012) show that there exist graphs with n vertices having obstacle number in Omega(n/\\log n). In this note, we up this lower bound to Omega(n/(\\log\\log n)^2. Our proof makes use of an upper bound of Mukkamala etal on the number of graphs having obstacle number at most h in such a way that any subsequent improvements to their upper bound will improve our lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4321","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:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPCQRax1ZgjtGQ+Olj7C4L16Wh0FlBLT16OBEfaDEeLFf+LX6rmOZurvMVj5ubyq54eHUTkIaqA5PzDE0PTIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:04:42.610278Z"},"content_sha256":"32e326d332becb1a5eccacde3138272e51345272c4bebe32442ac4d5eeec34cb","schema_version":"1.0","event_id":"sha256:32e326d332becb1a5eccacde3138272e51345272c4bebe32442ac4d5eeec34cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3/bundle.json","state_url":"https://pith.science/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3/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-02T14:04:42Z","links":{"resolver":"https://pith.science/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3","bundle":"https://pith.science/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3/bundle.json","state":"https://pith.science/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNWSNCQT2EPS4XJ7ZZKHQFKCX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JNWSNCQT2EPS4XJ7ZZKHQFKCX3","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":"70a963d214c2083e563a564e6b57451a438aae9d779a97e0f242476b17e8716d","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T14:38:17Z","title_canon_sha256":"deab98e9b3aa8c065d0d62ff3912ece9835d717ac59428855a8b27164e61f8bd"},"schema_version":"1.0","source":{"id":"1308.4321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4321","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4321v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4321","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"JNWSNCQT2EPS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNWSNCQT2EPS4XJ7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNWSNCQT","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:32e326d332becb1a5eccacde3138272e51345272c4bebe32442ac4d5eeec34cb","target":"graph","created_at":"2026-05-18T03:15:33Z","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 obstacle number is a new graph parameter introduced by Alpert, Koch, and Laison (2010). Mukkamala etal (2012) show that there exist graphs with n vertices having obstacle number in Omega(n/\\log n). In this note, we up this lower bound to Omega(n/(\\log\\log n)^2. Our proof makes use of an upper bound of Mukkamala etal on the number of graphs having obstacle number at most h in such a way that any subsequent improvements to their upper bound will improve our lower bound.","authors_text":"Pat Morin, Vida Dujmovi\\'c","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T14:38:17Z","title":"On Obstacle Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4321","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:b4c179797fa8d5ad79e4c8ac11fda5aec037864d34a8bc6f25cedf8ad3e4c715","target":"record","created_at":"2026-05-18T03:15:33Z","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":"70a963d214c2083e563a564e6b57451a438aae9d779a97e0f242476b17e8716d","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T14:38:17Z","title_canon_sha256":"deab98e9b3aa8c065d0d62ff3912ece9835d717ac59428855a8b27164e61f8bd"},"schema_version":"1.0","source":{"id":"1308.4321","kind":"arxiv","version":1}},"canonical_sha256":"4b6d268a13d11f2e5d3fce54781542beee0a264748c01dd7368c5655c463f615","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6d268a13d11f2e5d3fce54781542beee0a264748c01dd7368c5655c463f615","first_computed_at":"2026-05-18T03:15:33.156777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:33.156777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PXB699rN7suyyQiX4LUl1gEANitAy7EQyEdzXv/KzQpCb+SoAdwhGDViOjWuJ9FC3h8MPzpP1BV8xeGAh5hGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:33.157246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4c179797fa8d5ad79e4c8ac11fda5aec037864d34a8bc6f25cedf8ad3e4c715","sha256:32e326d332becb1a5eccacde3138272e51345272c4bebe32442ac4d5eeec34cb"],"state_sha256":"bdfeff7ed145de6473e751392023eee957c1af64599b2e5e2da439ebe3f7c2b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cfx7p9gGtmkXXmyxu+6RHCbhEMzIV5GvUBC3+x+GDImRKyy3q8hmCRhY9oYAodqJ6iOxJSvUdvt5JRfgXJfvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:04:42.612287Z","bundle_sha256":"6e0b77e28f71fc22abef0180a97e970ac2ab0473c7921e616217a107d1477d35"}}