{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NVKTONGLN7Q74COBE7QDQVN5DN","short_pith_number":"pith:NVKTONGL","canonical_record":{"source":{"id":"2312.11379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-18T17:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"ec26ab86781ae85c9a1ef2ada588225c8504db264a76bc1ba3f9663813e14c04","abstract_canon_sha256":"3ecaae6f615aa27e21e2a0f2ffd31fe08b8930682012f37adbf921aad15069e2"},"schema_version":"1.0"},"canonical_sha256":"6d553734cb6fe1fe09c127e03855bd1b76a660c138ff58e6c76205856636964a","source":{"kind":"arxiv","id":"2312.11379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.11379","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"2312.11379v1","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.11379","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"NVKTONGLN7Q7","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"pith_short_16","alias_value":"NVKTONGLN7Q74COB","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"pith_short_8","alias_value":"NVKTONGL","created_at":"2026-07-05T07:25:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NVKTONGLN7Q74COBE7QDQVN5DN","target":"record","payload":{"canonical_record":{"source":{"id":"2312.11379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-18T17:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"ec26ab86781ae85c9a1ef2ada588225c8504db264a76bc1ba3f9663813e14c04","abstract_canon_sha256":"3ecaae6f615aa27e21e2a0f2ffd31fe08b8930682012f37adbf921aad15069e2"},"schema_version":"1.0"},"canonical_sha256":"6d553734cb6fe1fe09c127e03855bd1b76a660c138ff58e6c76205856636964a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:33.268389Z","signature_b64":"VNMBV0DBmHVYOCareHYIYWowgWhw/Noq16TZQ53gBwLDRQmTqikS10d5xnuBpRI5MCkgzLQzgxl86IJvCRb1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d553734cb6fe1fe09c127e03855bd1b76a660c138ff58e6c76205856636964a","last_reissued_at":"2026-07-05T07:25:33.267848Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:33.267848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.11379","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-07-05T07:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDH15s8PRMQkjrNr+SJUez3c4nKdZ5TwkSHvNsgYGjN1f++5Syv/0OjUQWIPoMJUJh3O88kKWLj7BgWIe6E3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:50:11.118114Z"},"content_sha256":"fa0676a7c41e0bc587a6a8f0a2386166af32b3e87bc12f4cedbf4830ed042a0e","schema_version":"1.0","event_id":"sha256:fa0676a7c41e0bc587a6a8f0a2386166af32b3e87bc12f4cedbf4830ed042a0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NVKTONGLN7Q74COBE7QDQVN5DN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On locally finite ordered rooted trees and their rooted subtrees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleyah Dawkins, Elie Alhajjar, Geir Agnarsson","submitted_at":"2023-12-18T17:42:44Z","abstract_excerpt":"In this article we compare the known dynamical polynomial time algorithm for the game-over attack strategy, to that of the brute force approach; of checking all the ordered rooted subtrees of a given tree that represents a given computer network. Our approach is purely enumerative and combinatorial in nature. We first revisit known results about a doubly exponential sequence and generalize them. We then consider both finite and locally finite ordered rooted trees (LFOR-trees), and the class of their finite ordered rooted subtrees of bounded height, describing completely the LFOR-trees with no "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.11379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.11379/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHNdbpvPoXR/B6CdbLqlLXGnzf9aW9mj6ihxcOGrbxrQ+nBBNi78Zqb8l7pAFmC9/DuuPOGzh22mjaF0jVEnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:50:11.118502Z"},"content_sha256":"99aad700b18efb9256235d5e1f489bda8d99cefe20f92d7f149ea7a0e723650e","schema_version":"1.0","event_id":"sha256:99aad700b18efb9256235d5e1f489bda8d99cefe20f92d7f149ea7a0e723650e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVKTONGLN7Q74COBE7QDQVN5DN/bundle.json","state_url":"https://pith.science/pith/NVKTONGLN7Q74COBE7QDQVN5DN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVKTONGLN7Q74COBE7QDQVN5DN/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-07-07T14:50:11Z","links":{"resolver":"https://pith.science/pith/NVKTONGLN7Q74COBE7QDQVN5DN","bundle":"https://pith.science/pith/NVKTONGLN7Q74COBE7QDQVN5DN/bundle.json","state":"https://pith.science/pith/NVKTONGLN7Q74COBE7QDQVN5DN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVKTONGLN7Q74COBE7QDQVN5DN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NVKTONGLN7Q74COBE7QDQVN5DN","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":"3ecaae6f615aa27e21e2a0f2ffd31fe08b8930682012f37adbf921aad15069e2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-18T17:42:44Z","title_canon_sha256":"ec26ab86781ae85c9a1ef2ada588225c8504db264a76bc1ba3f9663813e14c04"},"schema_version":"1.0","source":{"id":"2312.11379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.11379","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"2312.11379v1","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.11379","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"NVKTONGLN7Q7","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"pith_short_16","alias_value":"NVKTONGLN7Q74COB","created_at":"2026-07-05T07:25:33Z"},{"alias_kind":"pith_short_8","alias_value":"NVKTONGL","created_at":"2026-07-05T07:25:33Z"}],"graph_snapshots":[{"event_id":"sha256:99aad700b18efb9256235d5e1f489bda8d99cefe20f92d7f149ea7a0e723650e","target":"graph","created_at":"2026-07-05T07:25: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.11379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article we compare the known dynamical polynomial time algorithm for the game-over attack strategy, to that of the brute force approach; of checking all the ordered rooted subtrees of a given tree that represents a given computer network. Our approach is purely enumerative and combinatorial in nature. We first revisit known results about a doubly exponential sequence and generalize them. We then consider both finite and locally finite ordered rooted trees (LFOR-trees), and the class of their finite ordered rooted subtrees of bounded height, describing completely the LFOR-trees with no ","authors_text":"Aleyah Dawkins, Elie Alhajjar, Geir Agnarsson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-18T17:42:44Z","title":"On locally finite ordered rooted trees and their rooted subtrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.11379","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:fa0676a7c41e0bc587a6a8f0a2386166af32b3e87bc12f4cedbf4830ed042a0e","target":"record","created_at":"2026-07-05T07:25: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":"3ecaae6f615aa27e21e2a0f2ffd31fe08b8930682012f37adbf921aad15069e2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-18T17:42:44Z","title_canon_sha256":"ec26ab86781ae85c9a1ef2ada588225c8504db264a76bc1ba3f9663813e14c04"},"schema_version":"1.0","source":{"id":"2312.11379","kind":"arxiv","version":1}},"canonical_sha256":"6d553734cb6fe1fe09c127e03855bd1b76a660c138ff58e6c76205856636964a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d553734cb6fe1fe09c127e03855bd1b76a660c138ff58e6c76205856636964a","first_computed_at":"2026-07-05T07:25:33.267848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:25:33.267848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNMBV0DBmHVYOCareHYIYWowgWhw/Noq16TZQ53gBwLDRQmTqikS10d5xnuBpRI5MCkgzLQzgxl86IJvCRb1Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T07:25:33.268389Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.11379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa0676a7c41e0bc587a6a8f0a2386166af32b3e87bc12f4cedbf4830ed042a0e","sha256:99aad700b18efb9256235d5e1f489bda8d99cefe20f92d7f149ea7a0e723650e"],"state_sha256":"8d42b7f6b05b92a798c73bae78df9bdad196fc78a12517f70ecead16051584dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MnyYJphrHhr7dNEPBZ9CU09tneS/FQJfxF2sSkhS8udDlRUSBj7kNHKcHRlZgW1QfICkf5Aiwd+xpflEpELAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:50:11.120481Z","bundle_sha256":"e4e2f6a2bc9d2b81f40e2473904ca302f0dc1cbbb80f204bea08bb3cec6ea3fc"}}