{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QQFJQMGSZQMWRBV54UUDJLQMWM","short_pith_number":"pith:QQFJQMGS","schema_version":"1.0","canonical_sha256":"840a9830d2cc196886bde52834ae0cb3398de2dcf1d41499b9be31df68d2b56b","source":{"kind":"arxiv","id":"1708.08906","version":1},"attestation_state":"computed","paper":{"title":"Online Circle and Sphere Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carla Negri Lintzmayer, Eduardo Candido Xavier, Fl\\'avio Keidi Miyazawa","submitted_at":"2017-08-29T17:48:51Z","abstract_excerpt":"In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different radii while the third one receive an online sequence of spheres (items) of different radii, and they want to pack the items into the minimum number of unit squares, isosceles right triangles of leg length one, and unit cubes, respectively. For Online Circle Packing in Squares, we improve the previous best-known competitive ratio for the bounded space version, when"},"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":"1708.08906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-29T17:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"87ba937fb7a96fbb6d58587f65bbc3a3e8f4b1c7fff028fc7949ffb5208e3049","abstract_canon_sha256":"366b97924aef9f8905c666f13318253f22dbea4e4859eb26df422c8d087fbd52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:25.259220Z","signature_b64":"s91DnNLfEecsfKdoo72MOofAQAfBaDx4MNj4NRUqeZpqd/SRWCN/ILEF21vMpgZBzng72SgdSiNj3gjwq4NLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"840a9830d2cc196886bde52834ae0cb3398de2dcf1d41499b9be31df68d2b56b","last_reissued_at":"2026-05-18T00:36:25.258512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:25.258512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Circle and Sphere Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carla Negri Lintzmayer, Eduardo Candido Xavier, Fl\\'avio Keidi Miyazawa","submitted_at":"2017-08-29T17:48:51Z","abstract_excerpt":"In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different radii while the third one receive an online sequence of spheres (items) of different radii, and they want to pack the items into the minimum number of unit squares, isosceles right triangles of leg length one, and unit cubes, respectively. For Online Circle Packing in Squares, we improve the previous best-known competitive ratio for the bounded space version, when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08906","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":"1708.08906","created_at":"2026-05-18T00:36:25.258625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08906v1","created_at":"2026-05-18T00:36:25.258625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08906","created_at":"2026-05-18T00:36:25.258625+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQFJQMGSZQMW","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQFJQMGSZQMWRBV5","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQFJQMGS","created_at":"2026-05-18T12:31:39.905425+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/QQFJQMGSZQMWRBV54UUDJLQMWM","json":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM.json","graph_json":"https://pith.science/api/pith-number/QQFJQMGSZQMWRBV54UUDJLQMWM/graph.json","events_json":"https://pith.science/api/pith-number/QQFJQMGSZQMWRBV54UUDJLQMWM/events.json","paper":"https://pith.science/paper/QQFJQMGS"},"agent_actions":{"view_html":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM","download_json":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM.json","view_paper":"https://pith.science/paper/QQFJQMGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08906&json=true","fetch_graph":"https://pith.science/api/pith-number/QQFJQMGSZQMWRBV54UUDJLQMWM/graph.json","fetch_events":"https://pith.science/api/pith-number/QQFJQMGSZQMWRBV54UUDJLQMWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM/action/storage_attestation","attest_author":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM/action/author_attestation","sign_citation":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM/action/citation_signature","submit_replication":"https://pith.science/pith/QQFJQMGSZQMWRBV54UUDJLQMWM/action/replication_record"}},"created_at":"2026-05-18T00:36:25.258625+00:00","updated_at":"2026-05-18T00:36:25.258625+00:00"}