{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BVAP5M7S3L73JKFTAQH4CHJJZ6","short_pith_number":"pith:BVAP5M7S","canonical_record":{"source":{"id":"1610.07468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T16:06:31Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"1976ea84aecdc8c9317e8953e51bc23a69c1c8ae184814bba7cb7fa7f5618458","abstract_canon_sha256":"d25a0f8c042fa1f544292addf712d2cc307efcf7d83867c1c7d6cc106f23c7bb"},"schema_version":"1.0"},"canonical_sha256":"0d40feb3f2daffb4a8b3040fc11d29cfa4e2cc23f7a6f28c1935f2e82e8177b5","source":{"kind":"arxiv","id":"1610.07468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07468","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07468v2","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07468","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"BVAP5M7S3L73","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVAP5M7S3L73JKFT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVAP5M7S","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BVAP5M7S3L73JKFTAQH4CHJJZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T16:06:31Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"1976ea84aecdc8c9317e8953e51bc23a69c1c8ae184814bba7cb7fa7f5618458","abstract_canon_sha256":"d25a0f8c042fa1f544292addf712d2cc307efcf7d83867c1c7d6cc106f23c7bb"},"schema_version":"1.0"},"canonical_sha256":"0d40feb3f2daffb4a8b3040fc11d29cfa4e2cc23f7a6f28c1935f2e82e8177b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:21.675958Z","signature_b64":"3pwqFYJkSCKE/p39ZbV77YFMk8HV02tGYj7drgmec3JSJQkqYOw625vn3tcoRBhf1Yya19jqwlh5D5bAj2FwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d40feb3f2daffb4a8b3040fc11d29cfa4e2cc23f7a6f28c1935f2e82e8177b5","last_reissued_at":"2026-05-18T01:01:21.675385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:21.675385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07468","source_version":2,"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-18T01:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fO+UxIzTCZ0oolwnuthU1CtP4aE3NpZog9K1Fpzl8cGrR13KdpCHEHEP86NQkDe4uoRooFtrYViblSsCO696AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:13:59.663763Z"},"content_sha256":"c135e54f5b7bac8e19c8d6ef45c5f76793a996ec58cfd4fccfb07d90c2b1d450","schema_version":"1.0","event_id":"sha256:c135e54f5b7bac8e19c8d6ef45c5f76793a996ec58cfd4fccfb07d90c2b1d450"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BVAP5M7S3L73JKFTAQH4CHJJZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditions on square geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Huda Chuangpishit, Jeannette Janssen","submitted_at":"2016-10-24T16:06:31Z","abstract_excerpt":"For any metric $d$ on $\\mathbb{R}^2$, an ($\\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\\|.\\|_{\\infty}$, the metric derived from the $L_{\\infty}$ norm, then $(\\mathbb{R} ^2,\\|.\\|_{\\infty})$-geometric graphs are precisely those graphs that are the intersection of two unit interval graphs. We refer to $(\\mathbb{R}^2,\\|.\\|_{\\infty})$-geometric graphs as square geometric graphs. We represent a characterization of square geometric graphs. Using this characterization we provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07468","kind":"arxiv","version":2},"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-18T01:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P85l6Jo95nYut8h0oZPyS/J3PifjT3DpWxcX+O3kjArTZslcde8GcPawbLpNKiaioBUOjRZWU0vRf8Oh4ig0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:13:59.664500Z"},"content_sha256":"134908280434b8f9144a426cbccd75abc5dd30129695d7f2dadbabc3195e533c","schema_version":"1.0","event_id":"sha256:134908280434b8f9144a426cbccd75abc5dd30129695d7f2dadbabc3195e533c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6/bundle.json","state_url":"https://pith.science/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6/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-26T05:13:59Z","links":{"resolver":"https://pith.science/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6","bundle":"https://pith.science/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6/bundle.json","state":"https://pith.science/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVAP5M7S3L73JKFTAQH4CHJJZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BVAP5M7S3L73JKFTAQH4CHJJZ6","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":"d25a0f8c042fa1f544292addf712d2cc307efcf7d83867c1c7d6cc106f23c7bb","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T16:06:31Z","title_canon_sha256":"1976ea84aecdc8c9317e8953e51bc23a69c1c8ae184814bba7cb7fa7f5618458"},"schema_version":"1.0","source":{"id":"1610.07468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07468","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07468v2","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07468","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"BVAP5M7S3L73","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVAP5M7S3L73JKFT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVAP5M7S","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:134908280434b8f9144a426cbccd75abc5dd30129695d7f2dadbabc3195e533c","target":"graph","created_at":"2026-05-18T01:01:21Z","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":"For any metric $d$ on $\\mathbb{R}^2$, an ($\\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\\|.\\|_{\\infty}$, the metric derived from the $L_{\\infty}$ norm, then $(\\mathbb{R} ^2,\\|.\\|_{\\infty})$-geometric graphs are precisely those graphs that are the intersection of two unit interval graphs. We refer to $(\\mathbb{R}^2,\\|.\\|_{\\infty})$-geometric graphs as square geometric graphs. We represent a characterization of square geometric graphs. Using this characterization we provide","authors_text":"Huda Chuangpishit, Jeannette Janssen","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T16:06:31Z","title":"Conditions on square geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07468","kind":"arxiv","version":2},"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:c135e54f5b7bac8e19c8d6ef45c5f76793a996ec58cfd4fccfb07d90c2b1d450","target":"record","created_at":"2026-05-18T01:01:21Z","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":"d25a0f8c042fa1f544292addf712d2cc307efcf7d83867c1c7d6cc106f23c7bb","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-24T16:06:31Z","title_canon_sha256":"1976ea84aecdc8c9317e8953e51bc23a69c1c8ae184814bba7cb7fa7f5618458"},"schema_version":"1.0","source":{"id":"1610.07468","kind":"arxiv","version":2}},"canonical_sha256":"0d40feb3f2daffb4a8b3040fc11d29cfa4e2cc23f7a6f28c1935f2e82e8177b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d40feb3f2daffb4a8b3040fc11d29cfa4e2cc23f7a6f28c1935f2e82e8177b5","first_computed_at":"2026-05-18T01:01:21.675385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:21.675385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3pwqFYJkSCKE/p39ZbV77YFMk8HV02tGYj7drgmec3JSJQkqYOw625vn3tcoRBhf1Yya19jqwlh5D5bAj2FwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:21.675958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c135e54f5b7bac8e19c8d6ef45c5f76793a996ec58cfd4fccfb07d90c2b1d450","sha256:134908280434b8f9144a426cbccd75abc5dd30129695d7f2dadbabc3195e533c"],"state_sha256":"4fa2bf35f31b51249532e171fbddad391e45b168615790f6edbac94d4cf0d99b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIHaJIjMrOXFcHV/CPsp+DAIR4s8I2SuOZssNIJPC1YmGf4Y2TxuX4pxfPqswFJYZ8zsw8qiUpTmiltHbfZrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:13:59.668262Z","bundle_sha256":"a0cd73bcfd18a565920bbafd617a23a00b7a76ed314d6bc1ac4af64e5536bcdf"}}