{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ESBM23USS5ZLR657NH6V6LGRGL","short_pith_number":"pith:ESBM23US","canonical_record":{"source":{"id":"1506.05313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T13:07:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"842ca0e378482cfb6444afcc8b483a34f529abb93dae52396c0fa7c7c5d7ba42","abstract_canon_sha256":"b2434799516d6e1adc53bea291fdf423b81802f7cca3f2dc8c08f2d901276ac3"},"schema_version":"1.0"},"canonical_sha256":"2482cd6e929772b8fbbf69fd5f2cd132fcde5cb91017ec319f77ce79f68e6ff8","source":{"kind":"arxiv","id":"1506.05313","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05313","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05313v2","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05313","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"ESBM23USS5ZL","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ESBM23USS5ZLR657","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ESBM23US","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ESBM23USS5ZLR657NH6V6LGRGL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T13:07:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"842ca0e378482cfb6444afcc8b483a34f529abb93dae52396c0fa7c7c5d7ba42","abstract_canon_sha256":"b2434799516d6e1adc53bea291fdf423b81802f7cca3f2dc8c08f2d901276ac3"},"schema_version":"1.0"},"canonical_sha256":"2482cd6e929772b8fbbf69fd5f2cd132fcde5cb91017ec319f77ce79f68e6ff8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:45.836180Z","signature_b64":"fejAFJaeKynLBgpXrJpQWuucVs5tOzSxVe95Ten6r0KYy/A9Yi9lnR4x1yXkZTolAZm3cIppSWfG0Exv5yfqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2482cd6e929772b8fbbf69fd5f2cd132fcde5cb91017ec319f77ce79f68e6ff8","last_reissued_at":"2026-05-18T01:41:45.835742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:45.835742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05313","source_version":2,"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-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hw7rRop53ywy9RC07UJ08TNYJQpxbMY2FRxeg1KEAmK3g+DcRaOvFYpnTfMSf8HtMo00FMznnhO/m0USCakUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:29:39.387091Z"},"content_sha256":"f3f3aefd7499bcb3318eb877b0ceab103be0a2ae481ed6d69012843c1874380b","schema_version":"1.0","event_id":"sha256:f3f3aefd7499bcb3318eb877b0ceab103be0a2ae481ed6d69012843c1874380b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ESBM23USS5ZLR657NH6V6LGRGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Dress Codes with Flowers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Gopal Benerjee, Manish K. Gupta","submitted_at":"2015-06-17T13:07:20Z","abstract_excerpt":"Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05313","kind":"arxiv","version":2},"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-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMyTqcs9nwPwR8NkipWBs2cRQ/ycGFTYABch3jNXbiY7mHnIGRPy9emD1eMA3V7sxkVtD9erDkcBucsVHO3nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:29:39.387541Z"},"content_sha256":"d1d759a37bdae9ed5227c2b7f28e50c6489e67696a6934bd026c657e908294ae","schema_version":"1.0","event_id":"sha256:d1d759a37bdae9ed5227c2b7f28e50c6489e67696a6934bd026c657e908294ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESBM23USS5ZLR657NH6V6LGRGL/bundle.json","state_url":"https://pith.science/pith/ESBM23USS5ZLR657NH6V6LGRGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESBM23USS5ZLR657NH6V6LGRGL/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-31T14:29:39Z","links":{"resolver":"https://pith.science/pith/ESBM23USS5ZLR657NH6V6LGRGL","bundle":"https://pith.science/pith/ESBM23USS5ZLR657NH6V6LGRGL/bundle.json","state":"https://pith.science/pith/ESBM23USS5ZLR657NH6V6LGRGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESBM23USS5ZLR657NH6V6LGRGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ESBM23USS5ZLR657NH6V6LGRGL","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":"b2434799516d6e1adc53bea291fdf423b81802f7cca3f2dc8c08f2d901276ac3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T13:07:20Z","title_canon_sha256":"842ca0e378482cfb6444afcc8b483a34f529abb93dae52396c0fa7c7c5d7ba42"},"schema_version":"1.0","source":{"id":"1506.05313","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05313","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05313v2","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05313","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"ESBM23USS5ZL","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ESBM23USS5ZLR657","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ESBM23US","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:d1d759a37bdae9ed5227c2b7f28e50c6489e67696a6934bd026c657e908294ae","target":"graph","created_at":"2026-05-18T01:41:45Z","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":"Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.","authors_text":"Krishna Gopal Benerjee, Manish K. Gupta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T13:07:20Z","title":"On Dress Codes with Flowers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05313","kind":"arxiv","version":2},"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:f3f3aefd7499bcb3318eb877b0ceab103be0a2ae481ed6d69012843c1874380b","target":"record","created_at":"2026-05-18T01:41:45Z","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":"b2434799516d6e1adc53bea291fdf423b81802f7cca3f2dc8c08f2d901276ac3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T13:07:20Z","title_canon_sha256":"842ca0e378482cfb6444afcc8b483a34f529abb93dae52396c0fa7c7c5d7ba42"},"schema_version":"1.0","source":{"id":"1506.05313","kind":"arxiv","version":2}},"canonical_sha256":"2482cd6e929772b8fbbf69fd5f2cd132fcde5cb91017ec319f77ce79f68e6ff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2482cd6e929772b8fbbf69fd5f2cd132fcde5cb91017ec319f77ce79f68e6ff8","first_computed_at":"2026-05-18T01:41:45.835742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:45.835742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fejAFJaeKynLBgpXrJpQWuucVs5tOzSxVe95Ten6r0KYy/A9Yi9lnR4x1yXkZTolAZm3cIppSWfG0Exv5yfqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:45.836180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05313","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3f3aefd7499bcb3318eb877b0ceab103be0a2ae481ed6d69012843c1874380b","sha256:d1d759a37bdae9ed5227c2b7f28e50c6489e67696a6934bd026c657e908294ae"],"state_sha256":"6a42b0f62c1dffe537110ec2104562f63ac18b834bdead68c5643928566d7944"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HnxRRvKvGlNe/fZR0Pa46eXY2r5zt2QbnDT6ko6T1UHIph9iHdqtpbTac+1cceVxo/1uiGQi2bZCsG8mC5HWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:29:39.391402Z","bundle_sha256":"5294e3b38324e8680dbf41bedfa3878d04d8cdb1850dfba6804bcfbc91b10ce2"}}