{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UPJNN2ATEWBCHYIVQLIHJVIRD3","short_pith_number":"pith:UPJNN2AT","canonical_record":{"source":{"id":"1612.04430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-13T23:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"5c5a890a5bd161a55adeaec96fa5278195788c57dc267e6efaef580bbb9f1f31","abstract_canon_sha256":"ea60a938d6406add0465bf3afcb1fd08c045fed6551201d1472c4f506ea65803"},"schema_version":"1.0"},"canonical_sha256":"a3d2d6e813258223e11582d074d5111ee8094027c26bf42b666029a2e674cd0b","source":{"kind":"arxiv","id":"1612.04430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04430","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04430v1","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04430","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"UPJNN2ATEWBC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPJNN2ATEWBCHYIV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPJNN2AT","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UPJNN2ATEWBCHYIVQLIHJVIRD3","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-13T23:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"5c5a890a5bd161a55adeaec96fa5278195788c57dc267e6efaef580bbb9f1f31","abstract_canon_sha256":"ea60a938d6406add0465bf3afcb1fd08c045fed6551201d1472c4f506ea65803"},"schema_version":"1.0"},"canonical_sha256":"a3d2d6e813258223e11582d074d5111ee8094027c26bf42b666029a2e674cd0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:59.593139Z","signature_b64":"MbYl75LlujnOh+53CPiu8NWJYfx/K+u+zsRKOOgVmKWIiSU450LBSLqr4Y0/SfAEMzUUcjeAFi/VIumc7GDuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3d2d6e813258223e11582d074d5111ee8094027c26bf42b666029a2e674cd0b","last_reissued_at":"2026-05-18T00:54:59.592599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:59.592599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04430","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-18T00:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUCoCaZSQeg2JLzhkWDdrBHOu3jR37USGliCe/DniDdymTCTL9JPGr9Mt2pUc8Xjsv+lAXjvbN0+oErcITzABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:51:36.692055Z"},"content_sha256":"34ac4b02f8903018f4c2df49e56c2d3a3d07fe4d5fac7b6283d600d8fa39c217","schema_version":"1.0","event_id":"sha256:34ac4b02f8903018f4c2df49e56c2d3a3d07fe4d5fac7b6283d600d8fa39c217"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UPJNN2ATEWBCHYIVQLIHJVIRD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Aesop Fable for Network Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dave Oran, Glenn Scott, Marc Mosko","submitted_at":"2016-12-13T23:33:44Z","abstract_excerpt":"Detecting loops in data networks usually involves counting down a hop limit or caching data at each hop to detect a cycle. Using a hop limit means that the origin of a packet must know the maximum distance a packet could travel without loops. It also means a loop is not detected until it travels that maximum distance, even if that is many loops. Caching a packet signature at each hop, such as a hash or nonce, could require large amounts of memory at every hop because that cached information must persist for as long as a loop could forward packets. This paper presents a new distributed loop det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04430","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-18T00:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0YQ+86d8r2LxAXoRh0z+DcbzbR8bSmdd/D31fPYjSXKB3IddzUWsKocFi0yIdHb9+XI5mY7hX3HenPW/OvDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:51:36.692418Z"},"content_sha256":"2e527aff11c5e6ad984c79721aa48887128e4db6a59f71078a45b94814bdd384","schema_version":"1.0","event_id":"sha256:2e527aff11c5e6ad984c79721aa48887128e4db6a59f71078a45b94814bdd384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3/bundle.json","state_url":"https://pith.science/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3/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-25T12:51:36Z","links":{"resolver":"https://pith.science/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3","bundle":"https://pith.science/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3/bundle.json","state":"https://pith.science/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPJNN2ATEWBCHYIVQLIHJVIRD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UPJNN2ATEWBCHYIVQLIHJVIRD3","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":"ea60a938d6406add0465bf3afcb1fd08c045fed6551201d1472c4f506ea65803","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-13T23:33:44Z","title_canon_sha256":"5c5a890a5bd161a55adeaec96fa5278195788c57dc267e6efaef580bbb9f1f31"},"schema_version":"1.0","source":{"id":"1612.04430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04430","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04430v1","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04430","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"UPJNN2ATEWBC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPJNN2ATEWBCHYIV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPJNN2AT","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:2e527aff11c5e6ad984c79721aa48887128e4db6a59f71078a45b94814bdd384","target":"graph","created_at":"2026-05-18T00:54:59Z","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":"Detecting loops in data networks usually involves counting down a hop limit or caching data at each hop to detect a cycle. Using a hop limit means that the origin of a packet must know the maximum distance a packet could travel without loops. It also means a loop is not detected until it travels that maximum distance, even if that is many loops. Caching a packet signature at each hop, such as a hash or nonce, could require large amounts of memory at every hop because that cached information must persist for as long as a loop could forward packets. This paper presents a new distributed loop det","authors_text":"Dave Oran, Glenn Scott, Marc Mosko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-13T23:33:44Z","title":"Aesop Fable for Network Loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04430","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:34ac4b02f8903018f4c2df49e56c2d3a3d07fe4d5fac7b6283d600d8fa39c217","target":"record","created_at":"2026-05-18T00:54:59Z","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":"ea60a938d6406add0465bf3afcb1fd08c045fed6551201d1472c4f506ea65803","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-13T23:33:44Z","title_canon_sha256":"5c5a890a5bd161a55adeaec96fa5278195788c57dc267e6efaef580bbb9f1f31"},"schema_version":"1.0","source":{"id":"1612.04430","kind":"arxiv","version":1}},"canonical_sha256":"a3d2d6e813258223e11582d074d5111ee8094027c26bf42b666029a2e674cd0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3d2d6e813258223e11582d074d5111ee8094027c26bf42b666029a2e674cd0b","first_computed_at":"2026-05-18T00:54:59.592599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:59.592599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MbYl75LlujnOh+53CPiu8NWJYfx/K+u+zsRKOOgVmKWIiSU450LBSLqr4Y0/SfAEMzUUcjeAFi/VIumc7GDuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:59.593139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ac4b02f8903018f4c2df49e56c2d3a3d07fe4d5fac7b6283d600d8fa39c217","sha256:2e527aff11c5e6ad984c79721aa48887128e4db6a59f71078a45b94814bdd384"],"state_sha256":"4f20b14589e672a2d9fb28e6ff62536fd305ef731598b713fb997d8e336420ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgBWudci+WaUSvlaNIPrfbDJb/uDA4qVIYUtb2Y+lL49idQ2Tpexj810K8AoaqAsnkrqXbgi5Mw6N+g4n3/+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:51:36.694308Z","bundle_sha256":"b2da05f711900b16f1c8e1aff93bc1972bf66b2b2686b52791785c0a7d674f04"}}