{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LY2J5IH6YSQN7HBPY532A6YRS3","short_pith_number":"pith:LY2J5IH6","canonical_record":{"source":{"id":"1507.06860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-07-24T14:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"95281b05306bdf87efbc3e00f6ba0db9a93d7eff537f7c30a63fa00ef17dd72d","abstract_canon_sha256":"2e1f98bc272e66972c7181ea8ee36ef6e90476043802d4aa7ae6e9e316f69025"},"schema_version":"1.0"},"canonical_sha256":"5e349ea0fec4a0df9c2fc777a07b1196c72e9389c4935ef72e9e77c2e5c22851","source":{"kind":"arxiv","id":"1507.06860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06860","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06860v1","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06860","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"LY2J5IH6YSQN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LY2J5IH6YSQN7HBP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LY2J5IH6","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LY2J5IH6YSQN7HBPY532A6YRS3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-07-24T14:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"95281b05306bdf87efbc3e00f6ba0db9a93d7eff537f7c30a63fa00ef17dd72d","abstract_canon_sha256":"2e1f98bc272e66972c7181ea8ee36ef6e90476043802d4aa7ae6e9e316f69025"},"schema_version":"1.0"},"canonical_sha256":"5e349ea0fec4a0df9c2fc777a07b1196c72e9389c4935ef72e9e77c2e5c22851","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:00.311560Z","signature_b64":"tvkczX2vb+id/4kGN7EBRGDidzRjXkoHsPqCkmaR/yV+lLZX6LVXjWDNlkONBRf/A6vojnehEymFkHKE+XukCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e349ea0fec4a0df9c2fc777a07b1196c72e9389c4935ef72e9e77c2e5c22851","last_reissued_at":"2026-05-18T00:21:00.310866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:00.310866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06860","source_version":1,"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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"au33bjPaUZrahClycYGXW+SnrQ3IE/0pA4wQc3U0ZP64qENyEkfWHyPI9BLuzMK4T4/W41vYZCY3ojMLJYQuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:21:29.874033Z"},"content_sha256":"b38d064ecd90784cf2e7862e788b62349e908370dc927440b86de368c7894b95","schema_version":"1.0","event_id":"sha256:b38d064ecd90784cf2e7862e788b62349e908370dc927440b86de368c7894b95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LY2J5IH6YSQN7HBPY532A6YRS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What is odd about binary Parseval frames?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Bernhard G. Bodmann, Jacob E. McLaney, Micah G. Bullock, Samantha N. Branum, Zachery J. Baker","submitted_at":"2015-07-24T14:35:15Z","abstract_excerpt":"This paper examines the construction and properties of binary Parseval frames. We address two questions: When does a binary Parseval frame have a complementary Parseval frame? Which binary symmetric idempotent matrices are Gram matrices of binary Parseval frames? In contrast to the case of real or complex Parseval frames, the answer to these questions is not always affirmative. The key to our understanding comes from an algorithm that constructs binary orthonormal sequences that span a given subspace, whenever possible. Special regard is given to binary frames whose Gram matrices are circulant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06860","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"},"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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HDzQrthSuFap+KaumsjQiZVUqrEeBtLRqpep8s0zFGI3TbuPrqDvxarIgQip7qXBNdqjQzHHMIdx/lrTx+6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:21:29.874385Z"},"content_sha256":"50713188757c1bcf54f89f5484999a599bec021a699437727ec282d633e00ed1","schema_version":"1.0","event_id":"sha256:50713188757c1bcf54f89f5484999a599bec021a699437727ec282d633e00ed1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LY2J5IH6YSQN7HBPY532A6YRS3/bundle.json","state_url":"https://pith.science/pith/LY2J5IH6YSQN7HBPY532A6YRS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LY2J5IH6YSQN7HBPY532A6YRS3/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-06-08T22:21:29Z","links":{"resolver":"https://pith.science/pith/LY2J5IH6YSQN7HBPY532A6YRS3","bundle":"https://pith.science/pith/LY2J5IH6YSQN7HBPY532A6YRS3/bundle.json","state":"https://pith.science/pith/LY2J5IH6YSQN7HBPY532A6YRS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LY2J5IH6YSQN7HBPY532A6YRS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LY2J5IH6YSQN7HBPY532A6YRS3","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":"2e1f98bc272e66972c7181ea8ee36ef6e90476043802d4aa7ae6e9e316f69025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-07-24T14:35:15Z","title_canon_sha256":"95281b05306bdf87efbc3e00f6ba0db9a93d7eff537f7c30a63fa00ef17dd72d"},"schema_version":"1.0","source":{"id":"1507.06860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06860","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06860v1","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06860","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"LY2J5IH6YSQN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LY2J5IH6YSQN7HBP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LY2J5IH6","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:50713188757c1bcf54f89f5484999a599bec021a699437727ec282d633e00ed1","target":"graph","created_at":"2026-05-18T00:21:00Z","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":"This paper examines the construction and properties of binary Parseval frames. We address two questions: When does a binary Parseval frame have a complementary Parseval frame? Which binary symmetric idempotent matrices are Gram matrices of binary Parseval frames? In contrast to the case of real or complex Parseval frames, the answer to these questions is not always affirmative. The key to our understanding comes from an algorithm that constructs binary orthonormal sequences that span a given subspace, whenever possible. Special regard is given to binary frames whose Gram matrices are circulant","authors_text":"Bernhard G. Bodmann, Jacob E. McLaney, Micah G. Bullock, Samantha N. Branum, Zachery J. Baker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-07-24T14:35:15Z","title":"What is odd about binary Parseval frames?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06860","kind":"arxiv","version":1},"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:b38d064ecd90784cf2e7862e788b62349e908370dc927440b86de368c7894b95","target":"record","created_at":"2026-05-18T00:21:00Z","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":"2e1f98bc272e66972c7181ea8ee36ef6e90476043802d4aa7ae6e9e316f69025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2015-07-24T14:35:15Z","title_canon_sha256":"95281b05306bdf87efbc3e00f6ba0db9a93d7eff537f7c30a63fa00ef17dd72d"},"schema_version":"1.0","source":{"id":"1507.06860","kind":"arxiv","version":1}},"canonical_sha256":"5e349ea0fec4a0df9c2fc777a07b1196c72e9389c4935ef72e9e77c2e5c22851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e349ea0fec4a0df9c2fc777a07b1196c72e9389c4935ef72e9e77c2e5c22851","first_computed_at":"2026-05-18T00:21:00.310866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:00.310866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tvkczX2vb+id/4kGN7EBRGDidzRjXkoHsPqCkmaR/yV+lLZX6LVXjWDNlkONBRf/A6vojnehEymFkHKE+XukCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:00.311560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b38d064ecd90784cf2e7862e788b62349e908370dc927440b86de368c7894b95","sha256:50713188757c1bcf54f89f5484999a599bec021a699437727ec282d633e00ed1"],"state_sha256":"6de040c205f47b7ce2228d1924d72fda37108a88f103131f85bf9a404b117415"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRE3KDLgAwChcaoBdTWmuMurKv23c2JNRPLNolFIXEEMYdpEl/DpOS/QhRV9f1dW3p+S6jJ6e01UbqNMlHHlAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:21:29.876479Z","bundle_sha256":"aa87bd8531c8bf92c4605df899245afce97b1250725c67a6c1f2b82b96286bc9"}}