{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W2POJ42YCYO2CILAKGNRIUSXGC","short_pith_number":"pith:W2POJ42Y","schema_version":"1.0","canonical_sha256":"b69ee4f358161da12160519b14525730a0cdc5e5c598a1d6ca5426c1b0571f91","source":{"kind":"arxiv","id":"1401.7414","version":1},"attestation_state":"computed","paper":{"title":"The Geometry of Homogeneous Two-Weight Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Honold","submitted_at":"2014-01-29T05:30:21Z","abstract_excerpt":"The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2]. Secondly, these codes are used to define a dual two-weight code and strongly regular graph similar to the classical case of projective linear two-weight codes over finite fields [3]."},"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":"1401.7414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T05:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"d146281c2087bdf353848ed0938f9272f5ec85112d1de7ab74806ec72b9a69df","abstract_canon_sha256":"a841d151cbcc55a65189547ee057b6a41b5588c73d501963c0fe520f811c9b5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.543643Z","signature_b64":"R0AXoiHxV7trOk5tKSxzkETTcinDkvSqhEpql0DCkVxig+r8Rbdweob0z+XELoJh1tdCgfDxH52eq7uVUfFjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b69ee4f358161da12160519b14525730a0cdc5e5c598a1d6ca5426c1b0571f91","last_reissued_at":"2026-05-18T03:00:48.542935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.542935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Geometry of Homogeneous Two-Weight Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Honold","submitted_at":"2014-01-29T05:30:21Z","abstract_excerpt":"The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2]. Secondly, these codes are used to define a dual two-weight code and strongly regular graph similar to the classical case of projective linear two-weight codes over finite fields [3]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7414","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.7414","created_at":"2026-05-18T03:00:48.543046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7414v1","created_at":"2026-05-18T03:00:48.543046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7414","created_at":"2026-05-18T03:00:48.543046+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2POJ42YCYO2","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2POJ42YCYO2CILA","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2POJ42Y","created_at":"2026-05-18T12:28:54.890064+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/W2POJ42YCYO2CILAKGNRIUSXGC","json":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC.json","graph_json":"https://pith.science/api/pith-number/W2POJ42YCYO2CILAKGNRIUSXGC/graph.json","events_json":"https://pith.science/api/pith-number/W2POJ42YCYO2CILAKGNRIUSXGC/events.json","paper":"https://pith.science/paper/W2POJ42Y"},"agent_actions":{"view_html":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC","download_json":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC.json","view_paper":"https://pith.science/paper/W2POJ42Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7414&json=true","fetch_graph":"https://pith.science/api/pith-number/W2POJ42YCYO2CILAKGNRIUSXGC/graph.json","fetch_events":"https://pith.science/api/pith-number/W2POJ42YCYO2CILAKGNRIUSXGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC/action/storage_attestation","attest_author":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC/action/author_attestation","sign_citation":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC/action/citation_signature","submit_replication":"https://pith.science/pith/W2POJ42YCYO2CILAKGNRIUSXGC/action/replication_record"}},"created_at":"2026-05-18T03:00:48.543046+00:00","updated_at":"2026-05-18T03:00:48.543046+00:00"}