{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KTKEKNHE3JRITXGUMUCM3IZUWW","short_pith_number":"pith:KTKEKNHE","canonical_record":{"source":{"id":"1807.01749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-04T19:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"3186a59f3bdbc18a03652519b86eb2f204fc1bfb0a7eacceff0461e150eee1cb","abstract_canon_sha256":"89c8619cedf46292cefa7f214c73bb9eda17503c080a3f63110bc83ed6057059"},"schema_version":"1.0"},"canonical_sha256":"54d44534e4da6289dcd46504cda334b5ad8c373dbc80c7c7afd3f0a21947407a","source":{"kind":"arxiv","id":"1807.01749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01749","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01749v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01749","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"KTKEKNHE3JRI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KTKEKNHE3JRITXGU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KTKEKNHE","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KTKEKNHE3JRITXGUMUCM3IZUWW","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-04T19:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"3186a59f3bdbc18a03652519b86eb2f204fc1bfb0a7eacceff0461e150eee1cb","abstract_canon_sha256":"89c8619cedf46292cefa7f214c73bb9eda17503c080a3f63110bc83ed6057059"},"schema_version":"1.0"},"canonical_sha256":"54d44534e4da6289dcd46504cda334b5ad8c373dbc80c7c7afd3f0a21947407a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:28.726282Z","signature_b64":"6okaSw9Ki6iwqz2NMscvep4m85iBPvw3DEPEoVcBiV0ivmAN/LVlenHFHNNGMOGb6i9zuDX/cRFKAiT+0fusBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d44534e4da6289dcd46504cda334b5ad8c373dbc80c7c7afd3f0a21947407a","last_reissued_at":"2026-05-18T00:11:28.725869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:28.725869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01749","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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8JPId2bUjTDo2993DjCisI6744JHXTRhbYSudvPaXkGUhH7HoPu3QExLPnQs0s4wLvs1eItHBlOiwQovRsbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:00:49.399699Z"},"content_sha256":"5ec55c082415e2478e293c7769fae8a275a8eb67981e5b5aff64260d8e8f5419","schema_version":"1.0","event_id":"sha256:5ec55c082415e2478e293c7769fae8a275a8eb67981e5b5aff64260d8e8f5419"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KTKEKNHE3JRITXGUMUCM3IZUWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph functionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas, Bogdan Alecu, Vadim Lozin","submitted_at":"2018-07-04T19:17:28Z","abstract_excerpt":"Let $G=(V,E)$ be a graph and $A$ its adjacency matrix. We say that a vertex $y \\in V$ is a function of vertices $x_1, \\ldots, x_k \\in V$ if there exists a Boolean function $f$ of $k$ variables such that for any vertex $z \\in V - \\{y, x_1, \\ldots, x_k\\}$, $A(y,z)=f(A(x_1,z),\\ldots,A(x_k,z))$. The functionality $fun(y)$ of vertex $y$ is the minimum $k$ such that $y$ is a function of $k$ vertices. The functionality $fun(G)$ of the graph $G$ is $\\max\\limits_H\\min\\limits_{y\\in V(H)}fun(y)$, where the maximum is taken over all induced subgraphs $H$ of $G$. In the present paper, we show that function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01749","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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oA2eRzOvmZYyqfS8gVdrRbH9jS/TIMlE2ERlzIPnn/3PlppHcNUq9uLRSVXpBw0UUB0NdKaXAFXFHqqed3GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:00:49.400225Z"},"content_sha256":"9c096a68c2fbfec8c27b657335527451a8e2a3a41eb61bd98828e5f87a86c44a","schema_version":"1.0","event_id":"sha256:9c096a68c2fbfec8c27b657335527451a8e2a3a41eb61bd98828e5f87a86c44a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTKEKNHE3JRITXGUMUCM3IZUWW/bundle.json","state_url":"https://pith.science/pith/KTKEKNHE3JRITXGUMUCM3IZUWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTKEKNHE3JRITXGUMUCM3IZUWW/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-05-29T15:00:49Z","links":{"resolver":"https://pith.science/pith/KTKEKNHE3JRITXGUMUCM3IZUWW","bundle":"https://pith.science/pith/KTKEKNHE3JRITXGUMUCM3IZUWW/bundle.json","state":"https://pith.science/pith/KTKEKNHE3JRITXGUMUCM3IZUWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTKEKNHE3JRITXGUMUCM3IZUWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KTKEKNHE3JRITXGUMUCM3IZUWW","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":"89c8619cedf46292cefa7f214c73bb9eda17503c080a3f63110bc83ed6057059","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-04T19:17:28Z","title_canon_sha256":"3186a59f3bdbc18a03652519b86eb2f204fc1bfb0a7eacceff0461e150eee1cb"},"schema_version":"1.0","source":{"id":"1807.01749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01749","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01749v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01749","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"KTKEKNHE3JRI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KTKEKNHE3JRITXGU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KTKEKNHE","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:9c096a68c2fbfec8c27b657335527451a8e2a3a41eb61bd98828e5f87a86c44a","target":"graph","created_at":"2026-05-18T00:11:28Z","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":"Let $G=(V,E)$ be a graph and $A$ its adjacency matrix. We say that a vertex $y \\in V$ is a function of vertices $x_1, \\ldots, x_k \\in V$ if there exists a Boolean function $f$ of $k$ variables such that for any vertex $z \\in V - \\{y, x_1, \\ldots, x_k\\}$, $A(y,z)=f(A(x_1,z),\\ldots,A(x_k,z))$. The functionality $fun(y)$ of vertex $y$ is the minimum $k$ such that $y$ is a function of $k$ vertices. The functionality $fun(G)$ of the graph $G$ is $\\max\\limits_H\\min\\limits_{y\\in V(H)}fun(y)$, where the maximum is taken over all induced subgraphs $H$ of $G$. In the present paper, we show that function","authors_text":"Aistis Atminas, Bogdan Alecu, Vadim Lozin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-04T19:17:28Z","title":"Graph functionality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01749","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:5ec55c082415e2478e293c7769fae8a275a8eb67981e5b5aff64260d8e8f5419","target":"record","created_at":"2026-05-18T00:11:28Z","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":"89c8619cedf46292cefa7f214c73bb9eda17503c080a3f63110bc83ed6057059","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-04T19:17:28Z","title_canon_sha256":"3186a59f3bdbc18a03652519b86eb2f204fc1bfb0a7eacceff0461e150eee1cb"},"schema_version":"1.0","source":{"id":"1807.01749","kind":"arxiv","version":1}},"canonical_sha256":"54d44534e4da6289dcd46504cda334b5ad8c373dbc80c7c7afd3f0a21947407a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54d44534e4da6289dcd46504cda334b5ad8c373dbc80c7c7afd3f0a21947407a","first_computed_at":"2026-05-18T00:11:28.725869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:28.725869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6okaSw9Ki6iwqz2NMscvep4m85iBPvw3DEPEoVcBiV0ivmAN/LVlenHFHNNGMOGb6i9zuDX/cRFKAiT+0fusBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:28.726282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec55c082415e2478e293c7769fae8a275a8eb67981e5b5aff64260d8e8f5419","sha256:9c096a68c2fbfec8c27b657335527451a8e2a3a41eb61bd98828e5f87a86c44a"],"state_sha256":"9e95927ce29f7dd06c8db26775f8796987c8b308980b28baa04d2e3ffcf81786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXF5jyhrwXIFnYORqjNvTU8k7IbnzJH7P85DgLnEC0rdVa98bWm928wRMDzTLxaizfrNWXkR5b719+zGtN33Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:00:49.403684Z","bundle_sha256":"547326755d449a0551a772819497bbc2c62361c641009ea8d6f5cc24eba16a77"}}