{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7WUST4GRHLBILM2EG7VCUDLGRI","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":"47e513e4c28afd0011102f98b7f9b7bc2a8a41ce166f78af3ab915f223df66c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T12:12:46Z","title_canon_sha256":"846e91e9cafb095d61e12330473fcc8d76a7dc096aaf7d4d1b9a9b8b19112a86"},"schema_version":"1.0","source":{"id":"1303.6801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6801","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6801v1","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6801","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"7WUST4GRHLBI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WUST4GRHLBILM2E","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WUST4GR","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:fdc7acf6158fac90a533086c56a5608982eef48c5be2c8c68c61e855f6f73183","target":"graph","created_at":"2026-05-18T03:29:39Z","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":"In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node. To optimize other DSS parameters such as computation and disk I/O, Distributed Replication-based Simple Storage (Dress) Codes consisting of an inner Fractional Repetition (FR) code and an outer MDS code are commonly used. Thus constructing FR codes is an important research problem, and several constructions using graphs and designs have been proposed. In this paper, we present an algorithm for constructing the node-packet distribution matrix of FR codes and thus enu","authors_text":"Manish K. Gupta, Srijan Anil, T. Aaron Gulliver","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T12:12:46Z","title":"Enumerating Some Fractional Repetition Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6801","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:ba09599f1298eee3e67bd1ff0b50babf6d7e7ebdba43dacc273bf91f2b55ee76","target":"record","created_at":"2026-05-18T03:29:39Z","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":"47e513e4c28afd0011102f98b7f9b7bc2a8a41ce166f78af3ab915f223df66c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T12:12:46Z","title_canon_sha256":"846e91e9cafb095d61e12330473fcc8d76a7dc096aaf7d4d1b9a9b8b19112a86"},"schema_version":"1.0","source":{"id":"1303.6801","kind":"arxiv","version":1}},"canonical_sha256":"fda929f0d13ac285b34437ea2a0d668a19ecc3b2c261a7bc9f3172236bf2a01e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fda929f0d13ac285b34437ea2a0d668a19ecc3b2c261a7bc9f3172236bf2a01e","first_computed_at":"2026-05-18T03:29:39.670072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:39.670072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zkiD911h1kvia7Fd6ZF8r8I1CX97YibI6W0p6tx6m6+KVc0QMgSFhvxmYO0GeaxnE/bb3IRBP4SWtHu7AacIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:39.670684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba09599f1298eee3e67bd1ff0b50babf6d7e7ebdba43dacc273bf91f2b55ee76","sha256:fdc7acf6158fac90a533086c56a5608982eef48c5be2c8c68c61e855f6f73183"],"state_sha256":"df94f0f5a273d83c9f55171211e5b39e7d6886f75cac602bc05f6f212595a8a2"}