{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZGAUZPWQOCOU4IZ3JQZUJN7XQ4","short_pith_number":"pith:ZGAUZPWQ","schema_version":"1.0","canonical_sha256":"c9814cbed0709d4e233b4c3344b7f7871691ab4c949e11cd81b15a20db3d9a56","source":{"kind":"arxiv","id":"2606.07047","version":1},"attestation_state":"computed","paper":{"title":"Front-to-Attractors: Modifying the Front-to-Front Heuristic in Bidirectional Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alvin Zou, Maxim Likhachev, Muhammad Suhail Saleem","submitted_at":"2026-06-05T08:46:27Z","abstract_excerpt":"Heuristics play a central role in the performance of bidirectional search algorithms, which commonly rely on two main classes. Front-to-end (F2E) heuristics estimate the distance from a state s to the target of the search (the goal for forward search or the start for backward search). In contrast, front-to-front (F2F) heuristics estimate the distance from s to the opposite search frontier using a pairwise function h(s, s'), where s' ranges over frontier states. Although F2F heuristics are typically more informative and therefore reduce the number of node expansions, their reliance on extensive"},"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":"2606.07047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-05T08:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"9dc375e9980da9b170cfd7efd19b3380083ff03c264a45b5b501fbbe920d3ee5","abstract_canon_sha256":"b921d6c8a3212c9e1815c868acece059b2e5752f547d63e66dd37f19603575bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:43.246793Z","signature_b64":"c3lSvlNO77Z5wOLW7Actt88pxaj0Qvebdfdqm7uVAnEr73xfF9DXFstbVK0eXhjTc77T5NYxuyFwVMPiJlTGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9814cbed0709d4e233b4c3344b7f7871691ab4c949e11cd81b15a20db3d9a56","last_reissued_at":"2026-06-08T01:04:43.246027Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:43.246027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Front-to-Attractors: Modifying the Front-to-Front Heuristic in Bidirectional Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alvin Zou, Maxim Likhachev, Muhammad Suhail Saleem","submitted_at":"2026-06-05T08:46:27Z","abstract_excerpt":"Heuristics play a central role in the performance of bidirectional search algorithms, which commonly rely on two main classes. Front-to-end (F2E) heuristics estimate the distance from a state s to the target of the search (the goal for forward search or the start for backward search). In contrast, front-to-front (F2F) heuristics estimate the distance from s to the opposite search frontier using a pairwise function h(s, s'), where s' ranges over frontier states. Although F2F heuristics are typically more informative and therefore reduce the number of node expansions, their reliance on extensive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07047","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/2606.07047/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.07047","created_at":"2026-06-08T01:04:43.246139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07047v1","created_at":"2026-06-08T01:04:43.246139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07047","created_at":"2026-06-08T01:04:43.246139+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGAUZPWQOCOU","created_at":"2026-06-08T01:04:43.246139+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGAUZPWQOCOU4IZ3","created_at":"2026-06-08T01:04:43.246139+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGAUZPWQ","created_at":"2026-06-08T01:04:43.246139+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/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4","json":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4.json","graph_json":"https://pith.science/api/pith-number/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/graph.json","events_json":"https://pith.science/api/pith-number/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/events.json","paper":"https://pith.science/paper/ZGAUZPWQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4","download_json":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4.json","view_paper":"https://pith.science/paper/ZGAUZPWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07047&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/action/storage_attestation","attest_author":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/action/author_attestation","sign_citation":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/action/citation_signature","submit_replication":"https://pith.science/pith/ZGAUZPWQOCOU4IZ3JQZUJN7XQ4/action/replication_record"}},"created_at":"2026-06-08T01:04:43.246139+00:00","updated_at":"2026-06-08T01:04:43.246139+00:00"}