{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6O7ODKR7C6WVE7LP3A5ISQQMJY","short_pith_number":"pith:6O7ODKR7","canonical_record":{"source":{"id":"1609.08067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-26T16:48:26Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"85897ba16794af3a6b735d4f2bc564ccab0f41282a69afb5192b178d8c4716b4","abstract_canon_sha256":"0f5ad2f19168bb4536a3a160c56fae75ea7d07e2471a868aeb3241d5f0637fcd"},"schema_version":"1.0"},"canonical_sha256":"f3bee1aa3f17ad527d6fd83a89420c4e03a1de5a3c53c8345d86ad08bb6c9a42","source":{"kind":"arxiv","id":"1609.08067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08067","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08067v3","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08067","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"6O7ODKR7C6WV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6O7ODKR7C6WVE7LP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6O7ODKR7","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6O7ODKR7C6WVE7LP3A5ISQQMJY","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-26T16:48:26Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"85897ba16794af3a6b735d4f2bc564ccab0f41282a69afb5192b178d8c4716b4","abstract_canon_sha256":"0f5ad2f19168bb4536a3a160c56fae75ea7d07e2471a868aeb3241d5f0637fcd"},"schema_version":"1.0"},"canonical_sha256":"f3bee1aa3f17ad527d6fd83a89420c4e03a1de5a3c53c8345d86ad08bb6c9a42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:20.028494Z","signature_b64":"mcMbVKEuAP8e+jBtyjjQG9Dc1kQKMgh/9PRgAe86Z03DLe+bWbP2z2BtU/+eXX+HbvA6HrEPnmrNoCv9oRT2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3bee1aa3f17ad527d6fd83a89420c4e03a1de5a3c53c8345d86ad08bb6c9a42","last_reissued_at":"2026-05-18T00:45:20.027781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:20.027781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08067","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-05-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fbam8UbVy90glAp4ZBSn+KcUGenR7EqVGI8g4c9PEXHwVdDi5ybs+impUHc1w/ifWsDB5aaYFgxKENGZ6x/SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:51:00.447182Z"},"content_sha256":"dec5469cc21bcbcb136f464753d1346aaee57282901d59abe447135f95cee770","schema_version":"1.0","event_id":"sha256:dec5469cc21bcbcb136f464753d1346aaee57282901d59abe447135f95cee770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6O7ODKR7C6WVE7LP3A5ISQQMJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metrics Based on Finite Directed Graphs and Coding Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Marcelo Firer, Roberto Assis Machado, Tuvi Etzion","submitted_at":"2016-09-26T16:48:26Z","abstract_excerpt":"Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\\mathbb{F}_q^n$, where $\\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a directed path starting at the support of the vector. Two canonical forms, which do not affect the metric, are given to each graph. Based on these forms we characterize each such metric. We further use these forms to prove that two graphs with different canonical forms yield different metrics. Efficient algorithms to check if a set of metric weights define a me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08067","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":""},"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-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFnikqLAyMOwE11PXCp3kxVHZYpjp5LRAEtLUMHJ/tPbDUcu6FPcntbl4z7YL2bJ/1Qb14DpyXwtL+Yr40NmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:51:00.447555Z"},"content_sha256":"899a7a3a7c2e885d609e85a35cd63521693adeda300787eb26bba7a72bcffcca","schema_version":"1.0","event_id":"sha256:899a7a3a7c2e885d609e85a35cd63521693adeda300787eb26bba7a72bcffcca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY/bundle.json","state_url":"https://pith.science/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY/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-30T07:51:00Z","links":{"resolver":"https://pith.science/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY","bundle":"https://pith.science/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY/bundle.json","state":"https://pith.science/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O7ODKR7C6WVE7LP3A5ISQQMJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6O7ODKR7C6WVE7LP3A5ISQQMJY","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":"0f5ad2f19168bb4536a3a160c56fae75ea7d07e2471a868aeb3241d5f0637fcd","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-26T16:48:26Z","title_canon_sha256":"85897ba16794af3a6b735d4f2bc564ccab0f41282a69afb5192b178d8c4716b4"},"schema_version":"1.0","source":{"id":"1609.08067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08067","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08067v3","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08067","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"6O7ODKR7C6WV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6O7ODKR7C6WVE7LP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6O7ODKR7","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:899a7a3a7c2e885d609e85a35cd63521693adeda300787eb26bba7a72bcffcca","target":"graph","created_at":"2026-05-18T00:45:20Z","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":"Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\\mathbb{F}_q^n$, where $\\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a directed path starting at the support of the vector. Two canonical forms, which do not affect the metric, are given to each graph. Based on these forms we characterize each such metric. We further use these forms to prove that two graphs with different canonical forms yield different metrics. Efficient algorithms to check if a set of metric weights define a me","authors_text":"Marcelo Firer, Roberto Assis Machado, Tuvi Etzion","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-26T16:48:26Z","title":"Metrics Based on Finite Directed Graphs and Coding Invariants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08067","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:dec5469cc21bcbcb136f464753d1346aaee57282901d59abe447135f95cee770","target":"record","created_at":"2026-05-18T00:45:20Z","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":"0f5ad2f19168bb4536a3a160c56fae75ea7d07e2471a868aeb3241d5f0637fcd","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-26T16:48:26Z","title_canon_sha256":"85897ba16794af3a6b735d4f2bc564ccab0f41282a69afb5192b178d8c4716b4"},"schema_version":"1.0","source":{"id":"1609.08067","kind":"arxiv","version":3}},"canonical_sha256":"f3bee1aa3f17ad527d6fd83a89420c4e03a1de5a3c53c8345d86ad08bb6c9a42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3bee1aa3f17ad527d6fd83a89420c4e03a1de5a3c53c8345d86ad08bb6c9a42","first_computed_at":"2026-05-18T00:45:20.027781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:20.027781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mcMbVKEuAP8e+jBtyjjQG9Dc1kQKMgh/9PRgAe86Z03DLe+bWbP2z2BtU/+eXX+HbvA6HrEPnmrNoCv9oRT2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:20.028494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dec5469cc21bcbcb136f464753d1346aaee57282901d59abe447135f95cee770","sha256:899a7a3a7c2e885d609e85a35cd63521693adeda300787eb26bba7a72bcffcca"],"state_sha256":"b21435a1babd2faa55b582a39bd9f4922e22a07c7ee8277301ededffc717d609"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leAwn+CjJA9zXl7L5th2LFyk+hbvz6B22d6ZFYcxw/A2r+DXgXDBqgm9fqo0DjlrBbtxMb5o16P88ctqzv98CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:51:00.449632Z","bundle_sha256":"0336491a9c57fe832c57999dfaf6469abb1635d5abd5cfabbbd612e9acfbd246"}}