{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6GLWLFHFU26AL2NGSYOO3G663O","short_pith_number":"pith:6GLWLFHF","schema_version":"1.0","canonical_sha256":"f1976594e5a6bc05e9a6961ced9bdedb9d459e10abe7f8aa97a06124975701de","source":{"kind":"arxiv","id":"1008.3773","version":1},"attestation_state":"computed","paper":{"title":"Fully Automatic Trunk Packing with Free Placements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Ernst Althaus, Peter Hachenberger","submitted_at":"2010-08-23T08:54:34Z","abstract_excerpt":"We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks."},"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":"1008.3773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-23T08:54:34Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"d86fda8e94c09a5638716328eaed52f8b499c77f1a7fbe50fddfbd33d954d173","abstract_canon_sha256":"bafea8ee5924ac7a367648ec52d35e1617095d05f39e83071b68d17951db590a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:55.253835Z","signature_b64":"W8gdrKIIWMHUYviCjzigXXJ+M3XP0UDweWXlcaamHlurUoHeEQT5C9jYUy5ptnAGvj6sfXrPJ7cm8auwzx6SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1976594e5a6bc05e9a6961ced9bdedb9d459e10abe7f8aa97a06124975701de","last_reissued_at":"2026-05-18T04:41:55.253397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:55.253397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Automatic Trunk Packing with Free Placements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Ernst Althaus, Peter Hachenberger","submitted_at":"2010-08-23T08:54:34Z","abstract_excerpt":"We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3773","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.3773","created_at":"2026-05-18T04:41:55.253467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3773v1","created_at":"2026-05-18T04:41:55.253467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3773","created_at":"2026-05-18T04:41:55.253467+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GLWLFHFU26A","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GLWLFHFU26AL2NG","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GLWLFHF","created_at":"2026-05-18T12:26:04.259169+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/6GLWLFHFU26AL2NGSYOO3G663O","json":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O.json","graph_json":"https://pith.science/api/pith-number/6GLWLFHFU26AL2NGSYOO3G663O/graph.json","events_json":"https://pith.science/api/pith-number/6GLWLFHFU26AL2NGSYOO3G663O/events.json","paper":"https://pith.science/paper/6GLWLFHF"},"agent_actions":{"view_html":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O","download_json":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O.json","view_paper":"https://pith.science/paper/6GLWLFHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3773&json=true","fetch_graph":"https://pith.science/api/pith-number/6GLWLFHFU26AL2NGSYOO3G663O/graph.json","fetch_events":"https://pith.science/api/pith-number/6GLWLFHFU26AL2NGSYOO3G663O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O/action/storage_attestation","attest_author":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O/action/author_attestation","sign_citation":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O/action/citation_signature","submit_replication":"https://pith.science/pith/6GLWLFHFU26AL2NGSYOO3G663O/action/replication_record"}},"created_at":"2026-05-18T04:41:55.253467+00:00","updated_at":"2026-05-18T04:41:55.253467+00:00"}