{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CYJTNACGABT7MILD2XVIGEPB3O","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":"0aaf71e529b0bc0688c609e773d44d17fdad9a928d1175d2dad85b3afeb81dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-04T09:37:57Z","title_canon_sha256":"1b20cac76b7d1ab85b103c7b3a13ddc7df43e2557b2113e75706d905f66ded19"},"schema_version":"1.0","source":{"id":"1805.01684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01684","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01684v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01684","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"CYJTNACGABT7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CYJTNACGABT7MILD","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CYJTNACG","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:d56d26e8f01e3993526f3d414251171666a218a462b1afe3ed0b59b3744c0b95","target":"graph","created_at":"2026-05-18T00:16:47Z","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":"We consider the problem of computing the size of each $r$-neighbourhood for every vertex of a graph. Specifically, we ask whether the size of the closed second neighbourhood can be computed in subquadratic time.\n  Adapting the SETH reductions by Abboud et al. (2016) that exclude subquadratic algorithms to compute the radius of a graph, we find that a subquadratic algorithm would violate the SETH. On the other hand, a linear fpt-time algorithm by Demaine et al. (2014) parameterized by a certain `sparseness parameter' of the graph is known, where the dependence on the parameter is exponential. W","authors_text":"Felix Reidl, George B. Mertzios, Gregory Gutin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-04T09:37:57Z","title":"Lower and Upper Bound for Computing the Size of All Second Neighbourhoods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01684","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:b75bdab1b841523ef06637a9594040d77179a9e8cc3ba95baa99f64e736d5fd1","target":"record","created_at":"2026-05-18T00:16:47Z","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":"0aaf71e529b0bc0688c609e773d44d17fdad9a928d1175d2dad85b3afeb81dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-04T09:37:57Z","title_canon_sha256":"1b20cac76b7d1ab85b103c7b3a13ddc7df43e2557b2113e75706d905f66ded19"},"schema_version":"1.0","source":{"id":"1805.01684","kind":"arxiv","version":1}},"canonical_sha256":"16133680460067f62163d5ea8311e1dbb2c820628901452766a50ddca77ca965","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16133680460067f62163d5ea8311e1dbb2c820628901452766a50ddca77ca965","first_computed_at":"2026-05-18T00:16:47.078011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.078011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0QeLeSg0NVNL7/XEwmpGaiYlWYh8J1vEHOOxGeIUsvLRivJ07cBTxFvzm3E0Msb+5OyfqF5ZzVoS5a9D6kYWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.078744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b75bdab1b841523ef06637a9594040d77179a9e8cc3ba95baa99f64e736d5fd1","sha256:d56d26e8f01e3993526f3d414251171666a218a462b1afe3ed0b59b3744c0b95"],"state_sha256":"824d33c22bf38c6aca244d98f47d1182e9713d807b0654248ed8133b8191eda8"}