{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TLMQJBFUM3Q73GABR2EVIS47WZ","short_pith_number":"pith:TLMQJBFU","schema_version":"1.0","canonical_sha256":"9ad90484b466e1fd98018e89544b9fb6636b32d7d4b1ff782a5d2b40ff0b0fa2","source":{"kind":"arxiv","id":"2005.04768","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.04768","created_at":"2026-07-05T03:21:05.351835+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.04768v3","created_at":"2026-07-05T03:21:05.351835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04768","created_at":"2026-07-05T03:21:05.351835+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLMQJBFUM3Q7","created_at":"2026-07-05T03:21:05.351835+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLMQJBFUM3Q73GAB","created_at":"2026-07-05T03:21:05.351835+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLMQJBFU","created_at":"2026-07-05T03:21:05.351835+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ","json":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ.json","graph_json":"https://pith.science/api/pith-number/TLMQJBFUM3Q73GABR2EVIS47WZ/graph.json","events_json":"https://pith.science/api/pith-number/TLMQJBFUM3Q73GABR2EVIS47WZ/events.json","paper":"https://pith.science/paper/TLMQJBFU"},"agent_actions":{"view_html":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ","download_json":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ.json","view_paper":"https://pith.science/paper/TLMQJBFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.04768&json=true","fetch_graph":"https://pith.science/api/pith-number/TLMQJBFUM3Q73GABR2EVIS47WZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TLMQJBFUM3Q73GABR2EVIS47WZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/action/storage_attestation","attest_author":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/action/author_attestation","sign_citation":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/action/citation_signature","submit_replication":"https://pith.science/pith/TLMQJBFUM3Q73GABR2EVIS47WZ/action/replication_record"}},"created_at":"2026-07-05T03:21:05.351835+00:00","updated_at":"2026-07-05T03:21:05.351835+00:00"}