{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TLMQJBFUM3Q73GABR2EVIS47WZ","short_pith_number":"pith:TLMQJBFU","canonical_record":{"source":{"id":"2005.04768","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-10T20:01:21Z","cross_cats_sorted":[],"title_canon_sha256":"b94d23eb89a9289b819596216ea35e50873e1cb9c69b6e5c28a4665c37e98aa7","abstract_canon_sha256":"bffd60d64b73f9e9cdd00ba59d2cebaf8b762deac3503bde7172babb6fc70de4"},"schema_version":"1.0"},"canonical_sha256":"9ad90484b466e1fd98018e89544b9fb6636b32d7d4b1ff782a5d2b40ff0b0fa2","source":{"kind":"arxiv","id":"2005.04768","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.04768","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"arxiv_version","alias_value":"2005.04768v3","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04768","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"pith_short_12","alias_value":"TLMQJBFUM3Q7","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"pith_short_16","alias_value":"TLMQJBFUM3Q73GAB","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"pith_short_8","alias_value":"TLMQJBFU","created_at":"2026-07-05T03:21:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TLMQJBFUM3Q73GABR2EVIS47WZ","target":"record","payload":{"canonical_record":{"source":{"id":"2005.04768","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-10T20:01:21Z","cross_cats_sorted":[],"title_canon_sha256":"b94d23eb89a9289b819596216ea35e50873e1cb9c69b6e5c28a4665c37e98aa7","abstract_canon_sha256":"bffd60d64b73f9e9cdd00ba59d2cebaf8b762deac3503bde7172babb6fc70de4"},"schema_version":"1.0"},"canonical_sha256":"9ad90484b466e1fd98018e89544b9fb6636b32d7d4b1ff782a5d2b40ff0b0fa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:05.352169Z","signature_b64":"UbhutkEdzKMUgz3At2B6TTsLbs92vDevrLPp233OfR5RiZa/z4DH5V20DJhcYTPtK6NllUyNXklvcnhz0yxODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad90484b466e1fd98018e89544b9fb6636b32d7d4b1ff782a5d2b40ff0b0fa2","last_reissued_at":"2026-07-05T03:21:05.351782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:05.351782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.04768","source_version":3,"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-07-05T03:21:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seqb3RXCmzU7Fai78T0X2+9QJcrbnhIsFZk53T7sPr2WTPGcnwNgM0iJy93+6S/rVAcl3OmQhoAINsK2muSRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:20:12.645450Z"},"content_sha256":"e10b2bd6813967a35926ae3705d85b69252443106c21cb9d8cf3a815a9ddb4ad","schema_version":"1.0","event_id":"sha256:e10b2bd6813967a35926ae3705d85b69252443106c21cb9d8cf3a815a9ddb4ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TLMQJBFUM3Q73GABR2EVIS47WZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for flag codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2020-05-10T20:01:21Z","abstract_excerpt":"The application of flags to network coding has been introduced recently by Liebhold, Nebe, and Vazquez-Castro. It is a variant to random linear network coding and explicit routing solutions for given networks. Here we study lower and upper bounds for the maximum possible cardinality of a corresponding flag code with given parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04768","kind":"arxiv","version":3},"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/2005.04768/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"},"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-07-05T03:21:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UeKhGemxBEl+5hmJMiPB/PC20/aMgt24w0d2kgJsC0j2CX1fbuAYPLfkA8+Zg24FlJ0GTWLO15o3bjCNGrBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:20:12.645946Z"},"content_sha256":"8c1620acb84eccc4c752be5785fdb624ac1bc570860fe0ae33ef4b5c7ceea494","schema_version":"1.0","event_id":"sha256:8c1620acb84eccc4c752be5785fdb624ac1bc570860fe0ae33ef4b5c7ceea494"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/bundle.json","state_url":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/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-08-12T04:20:12Z","links":{"resolver":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ","bundle":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/bundle.json","state":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TLMQJBFUM3Q73GABR2EVIS47WZ","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":"bffd60d64b73f9e9cdd00ba59d2cebaf8b762deac3503bde7172babb6fc70de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-10T20:01:21Z","title_canon_sha256":"b94d23eb89a9289b819596216ea35e50873e1cb9c69b6e5c28a4665c37e98aa7"},"schema_version":"1.0","source":{"id":"2005.04768","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.04768","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"arxiv_version","alias_value":"2005.04768v3","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04768","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"pith_short_12","alias_value":"TLMQJBFUM3Q7","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"pith_short_16","alias_value":"TLMQJBFUM3Q73GAB","created_at":"2026-07-05T03:21:05Z"},{"alias_kind":"pith_short_8","alias_value":"TLMQJBFU","created_at":"2026-07-05T03:21:05Z"}],"graph_snapshots":[{"event_id":"sha256:8c1620acb84eccc4c752be5785fdb624ac1bc570860fe0ae33ef4b5c7ceea494","target":"graph","created_at":"2026-07-05T03:21:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.04768/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The application of flags to network coding has been introduced recently by Liebhold, Nebe, and Vazquez-Castro. It is a variant to random linear network coding and explicit routing solutions for given networks. Here we study lower and upper bounds for the maximum possible cardinality of a corresponding flag code with given parameters.","authors_text":"Sascha Kurz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-10T20:01:21Z","title":"Bounds for flag codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04768","kind":"arxiv","version":3},"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:e10b2bd6813967a35926ae3705d85b69252443106c21cb9d8cf3a815a9ddb4ad","target":"record","created_at":"2026-07-05T03:21:05Z","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":"bffd60d64b73f9e9cdd00ba59d2cebaf8b762deac3503bde7172babb6fc70de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-10T20:01:21Z","title_canon_sha256":"b94d23eb89a9289b819596216ea35e50873e1cb9c69b6e5c28a4665c37e98aa7"},"schema_version":"1.0","source":{"id":"2005.04768","kind":"arxiv","version":3}},"canonical_sha256":"9ad90484b466e1fd98018e89544b9fb6636b32d7d4b1ff782a5d2b40ff0b0fa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ad90484b466e1fd98018e89544b9fb6636b32d7d4b1ff782a5d2b40ff0b0fa2","first_computed_at":"2026-07-05T03:21:05.351782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:05.351782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbhutkEdzKMUgz3At2B6TTsLbs92vDevrLPp233OfR5RiZa/z4DH5V20DJhcYTPtK6NllUyNXklvcnhz0yxODA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:05.352169Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.04768","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e10b2bd6813967a35926ae3705d85b69252443106c21cb9d8cf3a815a9ddb4ad","sha256:8c1620acb84eccc4c752be5785fdb624ac1bc570860fe0ae33ef4b5c7ceea494"],"state_sha256":"b545740042c2db68a7d6f3d326a8cc8537fd5c1ea4aea2b9e16481b5722a654f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGnaM5pvdCtTZNuQST8NPFJmMbEsrpBEGI7HYEqI4RvCIa8Iyk7fl9gITZWqkEfjF5Jz68NLPgkwQbaHFJNmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T04:20:12.651874Z","bundle_sha256":"9dbdc77045ca00a1502235975188f12a9867b430a5b069135f3467dacdc44cc0"}}