{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GJFMBXO4AIGPSGQQMONRBZG6OV","short_pith_number":"pith:GJFMBXO4","canonical_record":{"source":{"id":"2008.03669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2020-08-09T06:11:33Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2e0ba460e34a752127fa713442b194f0169533a34f5a25f8cc654cf8c574b9d4","abstract_canon_sha256":"54cbcabdf59229b81b2e05763670d82b287bd11201e91ad6f8cfae3a5087ef20"},"schema_version":"1.0"},"canonical_sha256":"324ac0dddc020cf91a10639b10e4de756b9973cce607a79bc45c7f0463b4e713","source":{"kind":"arxiv","id":"2008.03669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03669","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03669v1","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03669","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"pith_short_12","alias_value":"GJFMBXO4AIGP","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"pith_short_16","alias_value":"GJFMBXO4AIGPSGQQ","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"pith_short_8","alias_value":"GJFMBXO4","created_at":"2026-07-05T01:25:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GJFMBXO4AIGPSGQQMONRBZG6OV","target":"record","payload":{"canonical_record":{"source":{"id":"2008.03669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2020-08-09T06:11:33Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2e0ba460e34a752127fa713442b194f0169533a34f5a25f8cc654cf8c574b9d4","abstract_canon_sha256":"54cbcabdf59229b81b2e05763670d82b287bd11201e91ad6f8cfae3a5087ef20"},"schema_version":"1.0"},"canonical_sha256":"324ac0dddc020cf91a10639b10e4de756b9973cce607a79bc45c7f0463b4e713","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:44.244283Z","signature_b64":"jGpoUpGsg9gcV61mnR1mHCoytIjn/kKYly/DgZ/c2iXoCWX0qx8NexI2zzOEhiPT9Sj2W6kN+Naynj1wkhIYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"324ac0dddc020cf91a10639b10e4de756b9973cce607a79bc45c7f0463b4e713","last_reissued_at":"2026-07-05T01:25:44.243862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:44.243862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.03669","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-05T01:25:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5fICYH8rj2065u9g31PQr+c0bILeAJ2cSgGpufxvXZLLUOxvYK/PFBTcEELdGRvhwgYW2sDGOtyXCtsgJArDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:16:26.973300Z"},"content_sha256":"cbb6af9f94d64b73c720eb740c4f638bec96a3ed310ce2ba36dfa47bf696244a","schema_version":"1.0","event_id":"sha256:cbb6af9f94d64b73c720eb740c4f638bec96a3ed310ce2ba36dfa47bf696244a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GJFMBXO4AIGPSGQQMONRBZG6OV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.GR","authors_text":"Markus Friedrich, Pierre-Alain Fayolle, Sebastian Feld, Thomy Phan","submitted_at":"2020-08-09T06:11:33Z","abstract_excerpt":"Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design. Solutions based on algorithmic geometry impose constraints on usable model representations (e.g. quadric surfaces only) and noise robustness. Re-formulating the problem as a combinatorial optimization problem and solving it with an Evolutionary Algorithm can mitigate some of these constraints at the cost of increased computational complexity. This paper proposes a graph-based search space partitioning scheme that is able to accelerate Evolutionary Con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03669","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/2008.03669/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-05T01:25:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZzlb2hWu1iHC/EcAh9xBMH1zTg7YPrurTxDGaz/c30n2NsxonUSCEMAwYcPcv6MO0RzKp/az/OHr+bSSIP8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:16:26.973792Z"},"content_sha256":"7627c707d56c422a3642424c7db18f2417faa928d802220ee77e76494f2fd3a2","schema_version":"1.0","event_id":"sha256:7627c707d56c422a3642424c7db18f2417faa928d802220ee77e76494f2fd3a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJFMBXO4AIGPSGQQMONRBZG6OV/bundle.json","state_url":"https://pith.science/pith/GJFMBXO4AIGPSGQQMONRBZG6OV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJFMBXO4AIGPSGQQMONRBZG6OV/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-01T05:16:26Z","links":{"resolver":"https://pith.science/pith/GJFMBXO4AIGPSGQQMONRBZG6OV","bundle":"https://pith.science/pith/GJFMBXO4AIGPSGQQMONRBZG6OV/bundle.json","state":"https://pith.science/pith/GJFMBXO4AIGPSGQQMONRBZG6OV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJFMBXO4AIGPSGQQMONRBZG6OV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GJFMBXO4AIGPSGQQMONRBZG6OV","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":"54cbcabdf59229b81b2e05763670d82b287bd11201e91ad6f8cfae3a5087ef20","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2020-08-09T06:11:33Z","title_canon_sha256":"2e0ba460e34a752127fa713442b194f0169533a34f5a25f8cc654cf8c574b9d4"},"schema_version":"1.0","source":{"id":"2008.03669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03669","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03669v1","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03669","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"pith_short_12","alias_value":"GJFMBXO4AIGP","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"pith_short_16","alias_value":"GJFMBXO4AIGPSGQQ","created_at":"2026-07-05T01:25:44Z"},{"alias_kind":"pith_short_8","alias_value":"GJFMBXO4","created_at":"2026-07-05T01:25:44Z"}],"graph_snapshots":[{"event_id":"sha256:7627c707d56c422a3642424c7db18f2417faa928d802220ee77e76494f2fd3a2","target":"graph","created_at":"2026-07-05T01:25:44Z","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/2008.03669/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design. Solutions based on algorithmic geometry impose constraints on usable model representations (e.g. quadric surfaces only) and noise robustness. Re-formulating the problem as a combinatorial optimization problem and solving it with an Evolutionary Algorithm can mitigate some of these constraints at the cost of increased computational complexity. This paper proposes a graph-based search space partitioning scheme that is able to accelerate Evolutionary Con","authors_text":"Markus Friedrich, Pierre-Alain Fayolle, Sebastian Feld, Thomy Phan","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2020-08-09T06:11:33Z","title":"Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03669","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:cbb6af9f94d64b73c720eb740c4f638bec96a3ed310ce2ba36dfa47bf696244a","target":"record","created_at":"2026-07-05T01:25:44Z","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":"54cbcabdf59229b81b2e05763670d82b287bd11201e91ad6f8cfae3a5087ef20","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2020-08-09T06:11:33Z","title_canon_sha256":"2e0ba460e34a752127fa713442b194f0169533a34f5a25f8cc654cf8c574b9d4"},"schema_version":"1.0","source":{"id":"2008.03669","kind":"arxiv","version":1}},"canonical_sha256":"324ac0dddc020cf91a10639b10e4de756b9973cce607a79bc45c7f0463b4e713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"324ac0dddc020cf91a10639b10e4de756b9973cce607a79bc45c7f0463b4e713","first_computed_at":"2026-07-05T01:25:44.243862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:44.243862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jGpoUpGsg9gcV61mnR1mHCoytIjn/kKYly/DgZ/c2iXoCWX0qx8NexI2zzOEhiPT9Sj2W6kN+Naynj1wkhIYCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:44.244283Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.03669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbb6af9f94d64b73c720eb740c4f638bec96a3ed310ce2ba36dfa47bf696244a","sha256:7627c707d56c422a3642424c7db18f2417faa928d802220ee77e76494f2fd3a2"],"state_sha256":"a586bd6a2a576c1439da11cac54cda1164e26bbff4f4f1af36c28ffd9fd55312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvVZ+4BC4lQrzfxSUHBWCXrmD6WO45BcfZLd8y+0ie5l3vS4GMh3NywmGYuRucvVx8EgAm9ntXKhcHV8Gt0jDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T05:16:26.977799Z","bundle_sha256":"ddbee93592ba46679b4c56310c7841f31970057d835784f31be017e6c146e969"}}