{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZGDARY4JQH7JEUAUNWWO6EE7HD","short_pith_number":"pith:ZGDARY4J","canonical_record":{"source":{"id":"2607.27213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-06-01T07:42:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d8d4589a1174992fc3d22923fc4fd0b152a5a9a5a5f82b78b4dd32ed4bd7d994","abstract_canon_sha256":"566680cbf20196cf17780a72148b6274743b27b27ce47d6c97f519ac8859e44f"},"schema_version":"1.0"},"canonical_sha256":"c98608e38981fe9250146dacef109f38c54174fdce67ff4af19cb46d400b072e","source":{"kind":"arxiv","id":"2607.27213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27213","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27213v1","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27213","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZGDARY4JQH7J","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"ZGDARY4JQH7JEUAU","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"ZGDARY4J","created_at":"2026-07-31T00:10:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZGDARY4JQH7JEUAUNWWO6EE7HD","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-06-01T07:42:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d8d4589a1174992fc3d22923fc4fd0b152a5a9a5a5f82b78b4dd32ed4bd7d994","abstract_canon_sha256":"566680cbf20196cf17780a72148b6274743b27b27ce47d6c97f519ac8859e44f"},"schema_version":"1.0"},"canonical_sha256":"c98608e38981fe9250146dacef109f38c54174fdce67ff4af19cb46d400b072e","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98608e38981fe9250146dacef109f38c54174fdce67ff4af19cb46d400b072e","last_reissued_at":"2026-07-31T00:10:20.391875Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T00:10:20.391875Z"},"source_kind":"arxiv","source_id":"2607.27213","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-07-31T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/Rcodna3vn/L0Z7mrFds8o6jp/c+LUE5PDRfN9LrhfIjo53W6nV/8So02Jq7Ad9JXYMwuk7YwZY4Y7HNps9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T15:25:02.800127Z"},"content_sha256":"d5fd058ee4c6fa7fd4f1dd52925bacc82121c96a84a2a23bddca464af444e08c","schema_version":"1.0","event_id":"sha256:d5fd058ee4c6fa7fd4f1dd52925bacc82121c96a84a2a23bddca464af444e08c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZGDARY4JQH7JEUAUNWWO6EE7HD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Carlile Lavor, Michael Souza, Wagner da Rocha","submitted_at":"2026-06-01T07:42:14Z","abstract_excerpt":"The Distance Geometry Problem (DGP) asks for a geometric realization of a weighted graph with \\(n\\) vertices in \\(\\mathbb{R}^K\\) such that Euclidean distances between vertices match the given edge weights. When a vertex order where every non-seed vertex has \\(K\\) predecessors inducing a clique is part of the input, the search space can be discretized via \\(K\\)-lateration, branching into a binary tree. In this subclass, known as the Combinatorial Discretizable Distance Geometry Problem (Combinatorial DDGP), the goal is to determine the number of realizations satisfying all distance constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27213","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.27213/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"},"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-07-31T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiSv/LF4hBuSMYkjloJiATgQEnP8Mj7i5Dqul4ro/CJPox8dW9HTmNBNkrjyxZ5ObAAFQ1i2kWv9RR580SDDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T15:25:02.800655Z"},"content_sha256":"c4a3eef091cfc068263dea9e3c333a7170ed1eb72414a406edea5e0ea54030d3","schema_version":"1.0","event_id":"sha256:c4a3eef091cfc068263dea9e3c333a7170ed1eb72414a406edea5e0ea54030d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD/bundle.json","state_url":"https://pith.science/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD/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-08-22T15:25:02Z","links":{"resolver":"https://pith.science/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD","bundle":"https://pith.science/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD/bundle.json","state":"https://pith.science/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGDARY4JQH7JEUAUNWWO6EE7HD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZGDARY4JQH7JEUAUNWWO6EE7HD","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":"566680cbf20196cf17780a72148b6274743b27b27ce47d6c97f519ac8859e44f","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-06-01T07:42:14Z","title_canon_sha256":"d8d4589a1174992fc3d22923fc4fd0b152a5a9a5a5f82b78b4dd32ed4bd7d994"},"schema_version":"1.0","source":{"id":"2607.27213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27213","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27213v1","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27213","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZGDARY4JQH7J","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"ZGDARY4JQH7JEUAU","created_at":"2026-07-31T00:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"ZGDARY4J","created_at":"2026-07-31T00:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:c4a3eef091cfc068263dea9e3c333a7170ed1eb72414a406edea5e0ea54030d3","target":"graph","created_at":"2026-07-31T00:10: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.27213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Distance Geometry Problem (DGP) asks for a geometric realization of a weighted graph with \\(n\\) vertices in \\(\\mathbb{R}^K\\) such that Euclidean distances between vertices match the given edge weights. When a vertex order where every non-seed vertex has \\(K\\) predecessors inducing a clique is part of the input, the search space can be discretized via \\(K\\)-lateration, branching into a binary tree. In this subclass, known as the Combinatorial Discretizable Distance Geometry Problem (Combinatorial DDGP), the goal is to determine the number of realizations satisfying all distance constraints.","authors_text":"Carlile Lavor, Michael Souza, Wagner da Rocha","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27213","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:d5fd058ee4c6fa7fd4f1dd52925bacc82121c96a84a2a23bddca464af444e08c","target":"record","created_at":"2026-07-31T00:10: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":"566680cbf20196cf17780a72148b6274743b27b27ce47d6c97f519ac8859e44f","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2026-06-01T07:42:14Z","title_canon_sha256":"d8d4589a1174992fc3d22923fc4fd0b152a5a9a5a5f82b78b4dd32ed4bd7d994"},"schema_version":"1.0","source":{"id":"2607.27213","kind":"arxiv","version":1}},"canonical_sha256":"c98608e38981fe9250146dacef109f38c54174fdce67ff4af19cb46d400b072e","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98608e38981fe9250146dacef109f38c54174fdce67ff4af19cb46d400b072e","first_computed_at":"2026-07-31T00:10:20.391875Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T00:10:20.391875Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5fd058ee4c6fa7fd4f1dd52925bacc82121c96a84a2a23bddca464af444e08c","sha256:c4a3eef091cfc068263dea9e3c333a7170ed1eb72414a406edea5e0ea54030d3"],"state_sha256":"9c7dad82a86b96184bcc74b53cf39d599cf974708c6177fb300916f9f21564fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXIey1Ll12MMlWGlyR56eqW15VDLUOzOteqqxlKYPn3AfSTT47VWXfc1GpvGgN5bKCHs2A5m4hwmCS0/psnYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T15:25:02.804363Z","bundle_sha256":"d922d8595dab56008e99a3aa17d2a737d80dbdad38d48a67f18e058c935e4ffc"}}