{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XU6DZVKA5HUJ5CFKHIUXUH73XX","short_pith_number":"pith:XU6DZVKA","schema_version":"1.0","canonical_sha256":"bd3c3cd540e9e89e88aa3a297a1ffbbdc7dd65693014ed2c0e0ba7912c975376","source":{"kind":"arxiv","id":"2606.30261","version":1},"attestation_state":"computed","paper":{"title":"Robust secret storage in networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Vinko Zlati\\'c","submitted_at":"2026-06-29T13:09:25Z","abstract_excerpt":"The problem of storing secure information on a network is studied. A formal framework for distributed secret storage is introduced, and possible applications in technological and social systems are discussed. The problem is formulated as the optimization of a robustness functional in which two competing requirements are balanced: survivability under network-degrading processes and resistance to adversarial compromise. An exact representation of survivability is derived in terms of minimal information-carrying subgraphs (MICS), which provide a reduced description of the reconstruction events re"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.30261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-06-29T13:09:25Z","cross_cats_sorted":["cs.CR","physics.soc-ph"],"title_canon_sha256":"a5ccedb961e27192a59f9ff04a113d389e158744d8baa5a8958cd19ee7816a69","abstract_canon_sha256":"128f422147baecdac38ab46747b6905eb9d346a0a9b2763cf40d9d5442a3205d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:56.570514Z","signature_b64":"344hiOEHyQEQ4pgLnLTLSvT9WliZOjyMISltx0PDpTKFbUcahoCDzMkviDtAaQN1lTQDXKVMxxzokgr5Z8YlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd3c3cd540e9e89e88aa3a297a1ffbbdc7dd65693014ed2c0e0ba7912c975376","last_reissued_at":"2026-06-30T02:17:56.569970Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:56.569970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust secret storage in networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Vinko Zlati\\'c","submitted_at":"2026-06-29T13:09:25Z","abstract_excerpt":"The problem of storing secure information on a network is studied. A formal framework for distributed secret storage is introduced, and possible applications in technological and social systems are discussed. The problem is formulated as the optimization of a robustness functional in which two competing requirements are balanced: survivability under network-degrading processes and resistance to adversarial compromise. An exact representation of survivability is derived in terms of minimal information-carrying subgraphs (MICS), which provide a reduced description of the reconstruction events re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30261","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/2606.30261/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.30261","created_at":"2026-06-30T02:17:56.570046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30261v1","created_at":"2026-06-30T02:17:56.570046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30261","created_at":"2026-06-30T02:17:56.570046+00:00"},{"alias_kind":"pith_short_12","alias_value":"XU6DZVKA5HUJ","created_at":"2026-06-30T02:17:56.570046+00:00"},{"alias_kind":"pith_short_16","alias_value":"XU6DZVKA5HUJ5CFK","created_at":"2026-06-30T02:17:56.570046+00:00"},{"alias_kind":"pith_short_8","alias_value":"XU6DZVKA","created_at":"2026-06-30T02:17:56.570046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05385","citing_title":"Graph reconstruction from random-walk co-visitation: Geometric, empirical, and controlled networks","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX","json":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX.json","graph_json":"https://pith.science/api/pith-number/XU6DZVKA5HUJ5CFKHIUXUH73XX/graph.json","events_json":"https://pith.science/api/pith-number/XU6DZVKA5HUJ5CFKHIUXUH73XX/events.json","paper":"https://pith.science/paper/XU6DZVKA"},"agent_actions":{"view_html":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX","download_json":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX.json","view_paper":"https://pith.science/paper/XU6DZVKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30261&json=true","fetch_graph":"https://pith.science/api/pith-number/XU6DZVKA5HUJ5CFKHIUXUH73XX/graph.json","fetch_events":"https://pith.science/api/pith-number/XU6DZVKA5HUJ5CFKHIUXUH73XX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX/action/storage_attestation","attest_author":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX/action/author_attestation","sign_citation":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX/action/citation_signature","submit_replication":"https://pith.science/pith/XU6DZVKA5HUJ5CFKHIUXUH73XX/action/replication_record"}},"created_at":"2026-06-30T02:17:56.570046+00:00","updated_at":"2026-06-30T02:17:56.570046+00:00"}