{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OHIDQX7NHOGHUE3HEJVUSGJDL5","short_pith_number":"pith:OHIDQX7N","canonical_record":{"source":{"id":"1901.10475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-29T21:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"ba8d56b4b109aef7520ba57c9876879adcc4839f158b80a50e5ee1897a89f99f","abstract_canon_sha256":"def2b0c8518a386cb421637f939fb7ada1ee27779aa90f1c3c5ae465c58a77bf"},"schema_version":"1.0"},"canonical_sha256":"71d0385fed3b8c7a1367226b4919235f4d0eab84fa0005c6264acc9f4ddd1da7","source":{"kind":"arxiv","id":"1901.10475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10475","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10475v1","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10475","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"OHIDQX7NHOGH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHIDQX7NHOGHUE3H","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHIDQX7N","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OHIDQX7NHOGHUE3HEJVUSGJDL5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-29T21:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"ba8d56b4b109aef7520ba57c9876879adcc4839f158b80a50e5ee1897a89f99f","abstract_canon_sha256":"def2b0c8518a386cb421637f939fb7ada1ee27779aa90f1c3c5ae465c58a77bf"},"schema_version":"1.0"},"canonical_sha256":"71d0385fed3b8c7a1367226b4919235f4d0eab84fa0005c6264acc9f4ddd1da7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:06.818639Z","signature_b64":"iOZnt7yDF1nWWobMifN7feLYiX+ZM0o2URcfVibfxaADpcuWbRknV565wFgCpUuh+uPgVbANJjmNYTF4zQ3bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d0385fed3b8c7a1367226b4919235f4d0eab84fa0005c6264acc9f4ddd1da7","last_reissued_at":"2026-05-17T23:55:06.818154Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:06.818154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10475","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-17T23:55:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyw+vpGKNWozWmBVl/ZA1KZQDTrXBCA8e+90wqufwA7gejwNHtYSwbfTHLb0s6tEwuFoD3yivs12SL3H+vTlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:12:00.067740Z"},"content_sha256":"3e3eb059240d97d2b97f3b0f528b12c2f24f6f47e0fac532c73461c2810d5c10","schema_version":"1.0","event_id":"sha256:3e3eb059240d97d2b97f3b0f528b12c2f24f6f47e0fac532c73461c2810d5c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OHIDQX7NHOGHUE3HEJVUSGJDL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient n-to-n Collision Detection for Space Debris using 4D AABB Trees (Extended Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kerianne Hobbs, Stanley Bak","submitted_at":"2019-01-29T21:28:03Z","abstract_excerpt":"Collision detection algorithms are used in aerospace, swarm robotics, automotive, video gaming, dynamics simulation and other domains. As many applications of collision detection run online, timing requirements are imposed on the algorithm runtime: algorithms must, at a minimum, keep up with the passage of time. In practice, this places a limit on the number of objects, n, that can be tracked at the same time. In this paper, we improve the scalability of collision detection, effectively raising the limit n for online object tracking.\n  The key to our approach is the use of a four-dimensional a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10475","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-17T23:55:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vr+rtHnTvGTh0uO2qhBpwN76XYSMWQsixUUu9RonPCLXjH8ZsGaNLyejr9kO9+ppOGD8eWVcqkSJZHtz17xXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:12:00.068085Z"},"content_sha256":"3c11e37650d6c05b942ed0e70c25a15b014530cffc194c5d3538b058a0ce971c","schema_version":"1.0","event_id":"sha256:3c11e37650d6c05b942ed0e70c25a15b014530cffc194c5d3538b058a0ce971c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5/bundle.json","state_url":"https://pith.science/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5/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-03T16:12:00Z","links":{"resolver":"https://pith.science/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5","bundle":"https://pith.science/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5/bundle.json","state":"https://pith.science/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHIDQX7NHOGHUE3HEJVUSGJDL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OHIDQX7NHOGHUE3HEJVUSGJDL5","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":"def2b0c8518a386cb421637f939fb7ada1ee27779aa90f1c3c5ae465c58a77bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-29T21:28:03Z","title_canon_sha256":"ba8d56b4b109aef7520ba57c9876879adcc4839f158b80a50e5ee1897a89f99f"},"schema_version":"1.0","source":{"id":"1901.10475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10475","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10475v1","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10475","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"OHIDQX7NHOGH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHIDQX7NHOGHUE3H","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHIDQX7N","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:3c11e37650d6c05b942ed0e70c25a15b014530cffc194c5d3538b058a0ce971c","target":"graph","created_at":"2026-05-17T23:55:06Z","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":"Collision detection algorithms are used in aerospace, swarm robotics, automotive, video gaming, dynamics simulation and other domains. As many applications of collision detection run online, timing requirements are imposed on the algorithm runtime: algorithms must, at a minimum, keep up with the passage of time. In practice, this places a limit on the number of objects, n, that can be tracked at the same time. In this paper, we improve the scalability of collision detection, effectively raising the limit n for online object tracking.\n  The key to our approach is the use of a four-dimensional a","authors_text":"Kerianne Hobbs, Stanley Bak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-29T21:28:03Z","title":"Efficient n-to-n Collision Detection for Space Debris using 4D AABB Trees (Extended Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10475","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:3e3eb059240d97d2b97f3b0f528b12c2f24f6f47e0fac532c73461c2810d5c10","target":"record","created_at":"2026-05-17T23:55:06Z","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":"def2b0c8518a386cb421637f939fb7ada1ee27779aa90f1c3c5ae465c58a77bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-29T21:28:03Z","title_canon_sha256":"ba8d56b4b109aef7520ba57c9876879adcc4839f158b80a50e5ee1897a89f99f"},"schema_version":"1.0","source":{"id":"1901.10475","kind":"arxiv","version":1}},"canonical_sha256":"71d0385fed3b8c7a1367226b4919235f4d0eab84fa0005c6264acc9f4ddd1da7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71d0385fed3b8c7a1367226b4919235f4d0eab84fa0005c6264acc9f4ddd1da7","first_computed_at":"2026-05-17T23:55:06.818154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:06.818154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iOZnt7yDF1nWWobMifN7feLYiX+ZM0o2URcfVibfxaADpcuWbRknV565wFgCpUuh+uPgVbANJjmNYTF4zQ3bAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:06.818639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e3eb059240d97d2b97f3b0f528b12c2f24f6f47e0fac532c73461c2810d5c10","sha256:3c11e37650d6c05b942ed0e70c25a15b014530cffc194c5d3538b058a0ce971c"],"state_sha256":"e5f5aae0ea7fa1734751f73c31f87a588482879ef1e16427b314efbde5d24390"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9CP1h8Fr8UDDN5afdnS1KxsEkfxt7PdcL+2Il2yh630Th07Yeie8+K7Aarq2gF5SQOV7owyvzR2kBED+Q8FBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:12:00.070078Z","bundle_sha256":"769f02fa3ff8a38f9aa504f4e2bd1b0df2d24f5019cc0e184b6ef0163768b801"}}